Sciweavers

2173 search results - page 100 / 435
» On the Values of Reducibility Candidates
Sort
View
ICIAP
2007
ACM
15 years 10 months ago
Efficient and optimal block matching for motion estimation
This paper proposes a novel technique for performing fast block matching for motion estimation which is optimal, meaning it yields the same results as a full-search investigation....
Stefano Mattoccia, Federico Tombari, Luigi di Stef...
ICCAD
2006
IEEE
124views Hardware» more  ICCAD 2006»
15 years 6 months ago
Combinatorial algorithms for fast clock mesh optimization
We present a fast and efficient combinatorial algorithm to simultaneously identify the candidate locations as well as the sizes of the buffers driving a clock mesh. Due to the hi...
Ganesh Venkataraman, Zhuo Feng, Jiang Hu, Peng Li
DATE
2009
IEEE
135views Hardware» more  DATE 2009»
15 years 4 months ago
Heterogeneous coarse-grained processing elements: A template architecture for embedded processing acceleration
Reconfigurable Architectures are good candidates for application accelerators that cannot be set in stone at production time. FPGAs however, often suffer from the area and perfor...
Giovanni Ansaloni, Paolo Bonzini, Laura Pozzi
ICASSP
2009
IEEE
15 years 4 months ago
LSH banding for large-scale retrieval with memory and recall constraints
Locality Sensitive Hashing (LSH) is widely used for efficient retrieval of candidate matches in very large audio, video, and image systems. However, extremely large reference dat...
Michele Covell, Shumeet Baluja
CSL
2009
Springer
15 years 4 months ago
On the Relation between Sized-Types Based Termination and Semantic Labelling
We investigate the relationship between two independently developed termination techniques for rst and higher-order rewrite systems. On the one hand, sized-types based termination...
Frédéric Blanqui, Cody Roux