Sciweavers

4212 search results - page 143 / 843
» On Compressible Pairings and Their Computation
Sort
View
CVPR
2010
IEEE
15 years 10 months ago
Compression of Surface Registration using Beltrami Coefficients
Surface registration is widely used in machine vision and medical imaging, where 1-1 correspondences between surfaces are computed to study their variations. Surface maps are usua...
Lok Ming Lui
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
16 years 16 days ago
Adaptive Blocking: Learning to Scale Up Record Linkage
Many information integration tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as...
Mikhail Bilenko, Beena Kamath, Raymond J. Mooney
COLING
2010
15 years 1 months ago
Multi-Sentence Compression: Finding Shortest Paths in Word Graphs
We consider the task of summarizing a cluster of related sentences with a short sentence which we call multi-sentence compression and present a simple approach based on shortest p...
Katja Filippova
CVPR
2009
IEEE
2452views Computer Vision» more  CVPR 2009»
17 years 1 months ago
CHoG: Compressed Histogram of Gradients: A Low Bit-Rate Feature Descriptor
Establishing visual correspondences is an essential component of many computer vision problems, and is often done with robust, local feature-descriptors. Transmission and storag...
Vijay Chandrasekhar (Stanford University), Gabriel...
DCC
1999
IEEE
15 years 10 months ago
The Effect of Flexible Parsing for Dynamic Dictionary Based Data Compression
We report on the performance evaluation of greedy parsing with a single step lookahead, denoted as flexible parsing. We also introduce a new fingerprint based data structure which...
Yossi Matias, Nasir Rajpoot, Süleyman Cenk Sa...