Sciweavers

182 search results - page 14 / 37
» Approximate Colored Range Queries
Sort
View
VLDB
1997
ACM
141views Database» more  VLDB 1997»
14 years 17 days ago
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
Efficient user-adaptable similarity search more and more increases in its importance for multimedia and spatial database systems. As a general similarity model for multi-dimension...
Thomas Seidl, Hans-Peter Kriegel
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
14 years 8 months ago
Efficient top-k algorithms for fuzzy search in string collections
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...
Rares Vernica, Chen Li
GIS
2007
ACM
14 years 9 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....
JEA
2008
112views more  JEA 2008»
13 years 8 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
SIGMETRICS
2011
ACM
208views Hardware» more  SIGMETRICS 2011»
12 years 11 months ago
Structure-aware sampling on data streams
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
Edith Cohen, Graham Cormode, Nick G. Duffield