Sciweavers

318 search results - page 28 / 64
» A New Indexing Method for Approximate String Matching
Sort
View
65
Voted
WWW
2010
ACM
15 years 4 months ago
The anatomy of an ad: structured indexing and retrieval for sponsored search
The core task of sponsored search is to retrieve relevant ads for the user’s query. Ads can be retrieved either by exact match, when their bid term is identical to the query, or...
Michael Bendersky, Evgeniy Gabrilovich, Vanja Josi...
CORR
2012
Springer
224views Education» more  CORR 2012»
13 years 5 months ago
On Approximation Lower Bounds for TSP with Bounded Metrics
We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the b...
Marek Karpinski, Richard Schmied
ICASSP
2011
IEEE
14 years 1 months ago
Subsequence similarity language models
In this work we present the Subsequence Similarity Language Model (S2-LM) which is a new approach to language modeling based on string similarity. As a language model, S2-LM gener...
Juan M. Huerta
109
Voted
TIP
2002
116views more  TIP 2002»
14 years 9 months ago
Adaptive approximate nearest neighbor search for fractal image compression
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
Chong Sze Tong, Man Wong
ICASSP
2011
IEEE
14 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...