Sciweavers

3341 search results - page 128 / 669
» On Bounded Queries and Approximation
Sort
View
CIKM
1997
Springer
15 years 2 months ago
Block Addressing Indices for Approximate Text Retrieval
Although the issue of approximate text retrieval is gaining importance in the last years, it is currently addressed by only a few indexing schemes. To reduce space requirements, t...
Ricardo A. Baeza-Yates, Gonzalo Navarro
EDBT
2009
ACM
115views Database» more  EDBT 2009»
15 years 4 months ago
Top-k dominating queries in uncertain databases
Due to the existence of uncertain data in a wide spectrum of real applications, uncertain query processing has become increasingly important, which dramatically differs from handl...
Xiang Lian, Lei Chen 0002
DAWAK
2009
Springer
15 years 7 months ago
Recommending Multidimensional Queries.
Interactive analysis of datacube, in which a user navigates a cube by launching a sequence of queries is often tedious since the user may have no idea of what the forthcoming query...
Arnaud Giacometti, Elsa Negre, Patrick Marcel
GIS
2007
ACM
15 years 11 months ago
Approximate order-k Voronoi cells over positional streams
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
Kostas Patroumpas, Theofanis Minogiannis, Timos K....
FCCM
2006
IEEE
137views VLSI» more  FCCM 2006»
15 years 4 months ago
Single Pass, BLAST-Like, Approximate String Matching on FPGAs
Abstract: Approximate string matching is fundamental to bioinformatics, and has been the subject of numerous FPGA acceleration studies. We address issues with respect to FPGA imple...
Martin C. Herbordt, Josh Model, Yongfeng Gu, Bhara...