3020 search results - page 125 / 604 » Optimal partition trees |
198
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
190
click to vote
GRAPHICSINTERFACE
1997
15 years 7 months ago
1997
We present a system for incorporating multiple level of detail (LOD) models of 3D objects within a single hierarchical data structure. This system was designed for a scientific vi...
189
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
Structural information about a document is essential for structured query processing, indexing, and retrieval. A document page can be partitioned into a hierarchy of homogeneous r...
162
click to vote
DCC
2005
IEEE
16 years 6 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
166
click to vote
PKDD
2005
Springer
15 years 12 months ago
2005
Springer
Mining regression models from spatial data is a fundamental task in Spatial Data Mining. We propose a method, namely Mrs-SMOTI, that takes advantage from a tight-integration with s...