2514 search results - page 177 / 503 » On the Computation of Approximations of Database Queries |
189
click to vote
BTW
2007
Springer
15 years 10 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
291
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
In a current project, customers are attracted by a video streaming application. A video camera records people passing by, and a monitor shows an alienated version of the setting a...
223
click to vote
COMGEO
2002
ACM
15 years 6 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
189
click to vote
DASFAA
2008
IEEE
16 years 1 months ago
2008
IEEE
State-of-the-art Peer-to-Peer Information Retrieval (P2P IR) systems suffer from their lack of response time guarantee especially with scale. To address this issue, a number of tec...
190
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Existing SQL aggregate functions present important limitations to compute percentages. This article proposes two SQL aggregate functions to compute percentages addressing such lim...