1284 search results - page 12 / 257 » Data Structures for Mergeable Trees |
ICIP
2010
IEEE
13 years 4 months ago
2010
IEEE
Hyperspectral imaging segmentation has been an active research area over the past few years. Despite the growing interest, some factors such as high spectrum variability are still...
SIGCSE
2002
ACM
13 years 6 months ago
2002
ACM
We present our experience using a large, real-world application as a course project for the second half of the semester of a CS2 course. Our primary goal for the project was to cr...
PPOPP
2011
ACM
12 years 9 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
PODC
2010
ACM
13 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 ...
DAWAK
2005
Springer
14 years 7 days ago
2005
Springer
Abstract. We present a technique for discovering and representing changes between versions of data warehouse structures. We select a tree comparison algorithm, adapt it for the par...