Sciweavers

208 search results - page 26 / 42
» Variationally universal hashing
Sort
View
DCC
2004
IEEE
15 years 9 months ago
An Approximation to the Greedy Algorithm for Differential Compression of Very Large Files
We present a new differential compression algorithm that combines the hash value techniques and suffix array techniques of previous work. Differential compression refers to encodi...
Ramesh C. Agarwal, Suchitra Amalapurapu, Shaili Ja...
DILS
2007
Springer
15 years 3 months ago
Fast Approximate Duplicate Detection for 2D-NMR Spectra
2D-Nuclear magnetic resonance (NMR) spectroscopy is a powerful analytical method to elucidate the chemical structure of molecules. In contrast to 1D-NMR spectra, 2D-NMR spectra cor...
Björn Egert, Steffen Neumann, Alexander Hinne...
CVPR
2007
IEEE
15 years 11 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
87
Voted
ICIP
2007
IEEE
15 years 11 months ago
Query-Driven Locally Adaptive Fisher Faces and Expert-Model for Face Recognition
We present a novel expert-model of Query-Driven Locally Adaptive (QDLA) Fisher faces for robust face recognition. For each query face, the proposed method first fits local Fisher ...
Yun Fu, Junsong Yuan, Zhu Li, Thomas S. Huang, Yin...
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
15 years 11 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...