112 search results - page 7 / 23 » An Approximation Algorithm for Alphabet Indexing Problem |
SIGIR
2009
ACM
15 years 4 months ago
2009
ACM
This paper explores the problem of computing pairwise similarity on document collections, focusing on the application of “more like this” queries in the life sciences domain. ...
73
Voted
SPIRE
2005
Springer
15 years 3 months ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
NIPS
2004
14 years 11 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
We consider adaptive two-channel multiple-description coding. We provide an analytical method for designing a resolutionconstrained symmetrical multiple-description coder that use...