18 search results - page 3 / 4 » Phonetic Set Indexing for Fast Lexical Access |
TKDE
1998
13 years 7 months ago
1998
—We investigate the problem of retrieving similar shapes from a large database; in particular, we focus on medical tumor shapes (“Find tumors that are similar to a given patter...
SIGIR
2011
ACM
12 years 10 months ago
2011
ACM
Inverted indexes are the most fundamental and widely used data structures in information retrieval. For each unique word occurring in a document collection, the inverted index sto...
IDEAS
2007
IEEE
14 years 1 months ago
2007
IEEE
Historically, bitmap indexing has provided an important database capability to accelerate queries. However, only a few database systems have implemented these indexes because of t...
CIKM
2009
Springer
14 years 2 days ago
2009
Springer
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
CVPR
2007
IEEE
14 years 1 months ago
2007
IEEE
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...