3341 search results - page 263 / 669 » On Bounded Queries and Approximation |
149
Voted
EDBT
2000
ACM
15 years 11 months ago
2000
ACM
The paper presents Spatial Distributions Server – an analytical tool aimed at efficient creation, storing and analyzing of spatial distributions. Methods of approximation of spat...
164
click to vote
CIKM
2004
Springer
16 years 2 days ago
2004
Springer
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
172
click to vote
HOTOS
2007
IEEE
15 years 10 months ago
2007
IEEE
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
160
click to vote
DKE
2008
15 years 6 months ago
2008
Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents ...
204
click to vote
JGTOOLS
2006
15 years 6 months ago
2006
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...