Sciweavers

559 search results - page 78 / 112
» Algorithms and Data Structures for External Memory
Sort
View
ECCV
2002
Springer
16 years 6 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
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...
Thomas M. Breuel
VC
2008
143views more  VC 2008»
15 years 4 months ago
A single-pass GPU ray casting framework for interactive out-of-core rendering of massive volumetric datasets
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...
Enrico Gobbetti, Fabio Marton, José Antonio...
WWW
2007
ACM
16 years 5 months ago
Querying and maintaining a compact XML storage
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...
Raymond K. Wong, Franky Lam, William M. Shui
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
15 years 2 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
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...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
16 years 6 months ago
XML Prefiltering as a String Matching Problem
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...
Christoph Koch, Stefanie Scherzinger, Michael Schm...