7167 search results - page 798 / 1434 » Answer Set Programming |
254
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
271
Voted
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
Given a d-dimensional data set, a point p dominates another point q if it is better than or equal to q in all dimensions and better than q in at least one dimension. A point is a ...
220
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
186
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
Abstract. Sensor networks monitor physical phenomena over large geographic regions. Scientists can gain valuable insight into these phenomena, if they understand the underlying dat...
196
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...