559 search results - page 78 / 112 » Algorithms and Data Structures for External Memory |
115
click to vote
ECCV
2002
Springer
16 years 4 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
130
click to vote
VC
2008
15 years 2 months ago
2008
We present an adaptive out-of-core technique for rendering massive scalar volumes employing single pass GPU raycasting. The method is based on the decomposition of a volumetric dat...
123
click to vote
WWW
2007
ACM
16 years 3 months ago
2007
ACM
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...
194
click to vote
IFM
2010
Springer
15 years 11 days ago
2010
Springer
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
240
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
We propose a new technique for the efficient search and navigation in XML documents and streams. This technique takes string matching algorithms designed for efficient keyword sear...