Sciweavers

2157 search results - page 68 / 432
» Optimal Fast Hashing
Sort
View
ECCV
2010
Springer
15 years 4 months ago
Geodesic Shape Retrieval via Optimal Mass Transport
This paper presents a new method for 2-D and 3-D shape retrieval based on geodesic signatures. These signatures are high dimensional statistical distributions computed by extractin...
Julien Rabin, Gabriel Peyré, Laurent D. Coh...
138
Voted
ICIP
1998
IEEE
16 years 5 months ago
A Fast and Robust Point Tracking Algorithm
We present an algorithm that efficiently tracks a predefined set of landmark points in a time sequence of images. The algorithm iteratively optimizes the correspondences between t...
Cor J. Veenman, Emile A. Hendriks, Marcel J. T. Re...
ICS
2000
Tsinghua U.
15 years 7 months ago
Fast greedy weighted fusion
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
Ken Kennedy
ICCAD
1997
IEEE
53views Hardware» more  ICCAD 1997»
15 years 8 months ago
A quantitative approach to functional debugging
We introduce a novel cut-based debugging paradigm. It coordinates design emulation and simulation and enables fast transition from one to another. Emulation or functional implemen...
Darko Kirovski, Miodrag Potkonjak
ICIP
2000
IEEE
16 years 5 months ago
Fast Code Enhancement with Local Search for Fractal Image Compression
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...
Raouf Hamzaoui, Dietmar Saupe, Michael Hiller