In this paper a fully reconfigurable lifting kernel specifically designed for multimedia processing on FPGA is addressed. In particular since nowadays services such as video-conferencing, HDTV and Int...
In this paper a fully reconfigurable lifting kernel specifically designed for multimedia processing on FPGA is addressed. In particular since nowadays services such as video-conferencing, HDTV and Int...
Finding a cut or finding a matching in a graph are so simple problems that hardly are considered problems at all. Finding a cut whose split edges are a matching is expected to be a more difficult task...
Finding a cut or finding a matching in a graph are so simple problems that hardly are considered problems at all. Finding a cut whose split edges are a matching is expected to be a more difficult task...
This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distan...
We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discovery of such relationships ...
We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discovery of such relationships ...
Abstract. We study the problem of designing layout facilities for thenavigation of an "infinite " graph, i.e. a graph that is so large that its visualization is unfeasible, even by gluing to...