112 search results - page 13 / 23 » An Approximation Algorithm for Alphabet Indexing Problem |
99
Voted
CPM
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
99
Voted
CIKM
2011
Springer
13 years 11 months ago
2011
Springer
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
96
Voted
KDD
2001
ACM
16 years 1 days ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
100
Voted
CSL
2007
Springer
14 years 11 months ago
2007
Springer
The paper presents the Position Specific Posterior Lattice (PSPL), a novel lossy representation of automatic speech recognition lattices that naturally lends itself to efficient ...
193
Voted
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...