Sciweavers

2514 search results - page 67 / 503
» On the Computation of Approximations of Database Queries
Sort
View
ICDE
2007
IEEE
120views Database» more  ICDE 2007»
16 years 19 days ago
Support Concurrent Queries in Multiuser CBIR Systems
Various techniques have been developed for different query types in content-based image retrieval (CBIR) systems such as sampling queries, constrained sampling queries, multiple c...
Danzhou Liu, Kien A. Hua
GIS
2009
ACM
16 years 1 months ago
Constrained reverse nearest neighbor search on mobile objects
In this paper, we formalize the novel concept of Constrained Reverse k-Nearest Neighbor (CRkNN) search on mobile objects (clients) performed at a central server. The CRkNN query c...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
SARA
2007
Springer
16 years 13 days ago
Reformulation for Extensional Reasoning
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Tod...
Timothy L. Hinrichs, Michael R. Genesereth
SDM
2007
SIAM
106views Data Mining» more  SDM 2007»
15 years 7 months ago
Approximating Representations for Large Numerical Databases
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
Szymon Jaroszewicz, Marcin Korzen
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
13 years 8 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák