Sciweavers

2089 search results - page 140 / 418
» A New Problem in String Searching
Sort
View
CIKM
2008
Springer
14 years 11 months 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
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
15 years 10 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
ICADL
2003
Springer
147views Education» more  ICADL 2003»
15 years 3 months ago
Effective Image Annotation for Search Using Multi-level Semantics
There is an increasing need of development of automatic tools to annotate images for effective image searching in digital libraries. In this paper, we present a novel probabilistic...
Pu-Jen Cheng, Lee-Feng Chien
SSDBM
2002
IEEE
100views Database» more  SSDBM 2002»
15 years 2 months ago
Similarity Searching for Multi-Attribute Sequences
We investigate the problem of searching similar multiattribute time sequences. Such sequences arise naturally in a number of medical, financial, video, weather forecast, and stoc...
Tamer Kahveci, Ambuj K. Singh, Aliekber Gürel
SARA
2009
Springer
15 years 2 months ago
Light Algorithms for Maintaining Max-RPC During Search
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
Julien Vion, Romuald Debruyne