237 search results - page 7 / 48 » Methods for Achieving Fast Query Times in Point Location Dat... |
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
We propose XSEED, a synopsis of path queries for cardinality estimation that is accurate, robust, efficient, and adaptive to memory budgets. XSEED starts from a very small kernel,...
SIGMOD
2006
ACM
14 years 8 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
MICCAI
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. This paper presents a fast image synthesis procedure for elastic volumes under deformation. Given the node displacements of a mesh and the 3D image voxel data of an undef...
VLDB
1998
ACM
14 years 1 days ago
1998
ACM
We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These schemes are novel in that the ...
IJFCS
2002
13 years 7 months ago
2002
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...