Sciweavers

5 search results - page 1 / 1
» Searching in one billion vectors: re-rank with source coding
Sort
View
ICASSP
2011
IEEE
13 years 6 months ago
Searching in one billion vectors: re-rank with source coding
Recent indexing techniques inspired by source coding have been shown successful to index billions of high-dimensional vectors in memory. In this paper, we propose an approach that ...
Hervé Jégou and Romain Tavenard and Matthijs Dou...
ICIP
1995
IEEE
14 years 10 months ago
A lattice vector quantizer for generalized Gaussian sources
A fixed-rate lattice vector quantizer for generalized Gaussian (GG) sources is presented. By using the contour of counstant probability of a generalized Gaussian source to bound t...
Feng Chen, Zheng Gao, John D. Villasenor
CVPR
2008
IEEE
14 years 11 months ago
Small codes and large image databases for recognition
The Internet contains billions of images, freely available online. Methods for efficiently searching this incredibly rich resource are vital for a large number of applications. Th...
Antonio B. Torralba, Robert Fergus, Yair Weiss
BMCBI
2011
13 years 28 days ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
DLS
2005
176views Languages» more  DLS 2005»
13 years 11 months ago
Dynamic data polyvariance using source-tagged classes
The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are dynamically typed and have higher-order control flow...
S. Alexander Spoon, Olin Shivers