Sciweavers

3341 search results - page 29 / 669
» On Bounded Queries and Approximation
Sort
View
GIS
2009
ACM
14 years 3 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...
VLDB
2007
ACM
141views Database» more  VLDB 2007»
14 years 8 months ago
Query Processing over Incomplete Autonomous Databases
Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through media...
Garrett Wolf, Hemal Khatri, Bhaumik Chokshi, Jianc...
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 3 months ago
Data Cleaning and Query Answering with Matching Dependencies and Matching Functions
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
Leopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. La...
APPROX
2005
Springer
90views Algorithms» more  APPROX 2005»
14 years 2 months ago
Tight Bounds for String Reconstruction Using Substring Queries
We resolve two open problems presented in [8]. First, we consider the problem of reconstructing an unknown string T over a fixed alphabet using queries of the form “does the st...
Dekel Tsur
COCO
2001
Springer
108views Algorithms» more  COCO 2001»
14 years 1 months ago
Bounded Query Functions with Limited Output Bits
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For ...
Richard Chang, Jon S. Squire