4541 search results - page 464 / 909 » Cache-Oblivious Algorithms and Data Structures |
136
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
130
Voted
VRCAI
2006
ACM
15 years 11 months ago
2006
ACM
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
131
Voted
EUROPAR
2001
Springer
15 years 9 months ago
2001
Springer
Distributed-system observation tools require an efficient data structure to store and query the partial-order of execution. Such data structures typically use vector timestamps to...
146
click to vote
CGF
2008
15 years 5 months ago
2008
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
162
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Retrieval queries that combine structural constraints with keyword search represent a significant challenge to XML data management systems. Queries are expected to be answered as...