Sciweavers

390 search results - page 37 / 78
» Approximate Query Answering in Locally Closed Databases
Sort
View
DFG
2007
Springer
15 years 4 months ago
Natural Neighbor Concepts in Scattered Data Interpolation and Discrete Function Approximation
: The concept of natural neighbors employs the notion of distance to define local neighborhoods in discrete data. Especially when querying and accessing large scale data, it is im...
Tom Bobach, Georg Umlauf
CVPR
1997
IEEE
15 years 11 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
EDBT
2009
ACM
145views Database» more  EDBT 2009»
15 years 1 months ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...
EDBT
2011
ACM
281views Database» more  EDBT 2011»
14 years 1 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo
PODS
2004
ACM
98views Database» more  PODS 2004»
15 years 10 months ago
Processing First-Order Queries under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
Alan Nash, Bertram Ludäscher