Sciweavers

2969 search results - page 554 / 594
» A space efficient algorithm for group structure computation
Sort
View
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
16 years 3 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner
GRAPHITE
2007
ACM
15 years 7 months ago
Appearance preserving octree-textures
Because of their geometric complexity, high resolution 3D models, either designed in high-end modeling packages or acquired with range scanning devices, cannot be directly used in...
Julien Lacoste, Tamy Boubekeur, Bruno Jobard, Chri...
SIAMSC
2008
131views more  SIAMSC 2008»
15 years 2 months ago
Gramian-Based Model Reduction for Data-Sparse Systems
Model order reduction (MOR) is common in simulation, control and optimization of complex dynamical systems arising in modeling of physical processes and in the spatial discretizati...
Ulrike Baur, Peter Benner
WABI
2009
Springer
102views Bioinformatics» more  WABI 2009»
15 years 9 months ago
A Tree Based Method for the Rapid Screening of Chemical Fingerprints
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
Thomas G. Kristensen, Jesper Nielsen, Christian N....
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
16 years 3 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer