Sciweavers

1381 search results - page 226 / 277
» Structural signatures for tree data structures
Sort
View
PG
2007
IEEE
14 years 3 months ago
Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
Oskar Åkerlund, Mattias Unger, Rui Wang
IPPS
2005
IEEE
14 years 2 months ago
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
Guojing Cong, David A. Bader
VLDB
1994
ACM
129views Database» more  VLDB 1994»
14 years 1 months ago
Hilbert R-tree: An Improved R-tree using Fractals
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
Ibrahim Kamel, Christos Faloutsos
ADC
2008
Springer
143views Database» more  ADC 2008»
13 years 11 months ago
TRACK : A Novel XML Join Algorithm for Efficient Processing Twig Queries
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...
Dongyang Li, Chunping Li
TMI
2008
108views more  TMI 2008»
13 years 8 months ago
A Comprehensive Approach to the Analysis of Contrast Enhanced Cardiac MR Images
Abstract--Current magnetic resonance imaging (MRI) technology allows the determination of patient-individual coronary tree structure, detection of infarctions, and assessment of my...
Anja Hennemuth, A. Seeger, Ola Friman, S. Miller, ...