Sciweavers

1381 search results - page 38 / 277
» Structural signatures for tree data structures
Sort
View
DRM
2007
Springer
14 years 1 months ago
Data structures for limited oblivious execution of programs while preserving locality of reference
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
Avinash V. Varadarajan, Ramarathnam Venkatesan, C....
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
14 years 9 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
MMM
2007
Springer
107views Multimedia» more  MMM 2007»
14 years 2 months ago
Hierarchical Indexing Structure for 3D Human Motions
Content-based retrieval of 3D human motion capture data has significant impact in different fields such as physical medicine, rehabilitation, and animation. This paper develops ...
Gaurav N. Pradhan, Chuanjun Li, Balakrishnan Prabh...
ICIP
1999
IEEE
14 years 9 months ago
Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
Laurent Balmelli, Jelena Kovacevic, Martin Vetterl...
POPL
2008
ACM
14 years 8 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson