Sciweavers

182 search results - page 33 / 37
» Approximate Colored Range Queries
Sort
View
WWW
2005
ACM
15 years 10 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
PVLDB
2008
116views more  PVLDB 2008»
14 years 9 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
SSDBM
2009
IEEE
192views Database» more  SSDBM 2009»
15 years 4 months ago
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
Rahul Malik, Sangkyum Kim, Xin Jin, Chandrasekar R...
92
Voted
ACCV
2007
Springer
15 years 1 months ago
Efficient Search in Document Image Collections
This paper presents an efficient indexing and retrieval scheme for searching in document image databases. In many non-European languages, optical character recognizers are not very...
Anand Kumar 0002, C. V. Jawahar, R. Manmatha
SDB
1995
91views Database» more  SDB 1995»
15 years 1 months ago
Semantics in Spatial Databases
In this paper we discuss two data models for spatial database systems: the linear data model and the topological data model. Both can be used to model a wide range of applications....
Bart Kuijpers, Jan Paredaens, Luc Vandeurzen