Sciweavers

180 search results - page 20 / 36
» Approximate Searching on Compressed Text
Sort
View
SDM
2011
SIAM
223views Data Mining» more  SDM 2011»
13 years 1 months ago
Characterizing Uncertain Data using Compression
Motivated by sensor networks, mobility data, biology and life sciences, the area of mining uncertain data has recently received a great deal of attention. While various papers hav...
Francesco Bonchi, Matthijs van Leeuwen, Antti Ukko...
KCAP
2005
ACM
14 years 4 months ago
Indirect anaphora resolution as semantic path search
Anaphora occur commonly in natural language text, and resolving them is essential for capturing the knowledge encoded in text. Indirect anaphora are especially challenging to reso...
James Fan, Ken Barker, Bruce W. Porter
IJFCS
2006
87views more  IJFCS 2006»
13 years 11 months ago
Flexible Music Retrieval in Sublinear Time
Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retr...
Kimmo Fredriksson, Veli Mäkinen, Gonzalo Nava...
CIKM
2008
Springer
14 years 21 days ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
CIKM
2008
Springer
14 years 27 days ago
A metric cache for similarity search
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...