3020 search results - page 233 / 604 » Optimal partition trees |
307
click to vote
ICDE
2004
IEEE
16 years 8 months ago
2004
IEEE
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...
150
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
We generalize our results of [8, 9] and propose a new framework of multitree dictionaries which include many previously proposed dictionaries as well as many new, very large, tree...
169
click to vote
ISSS
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper examines the problem of code-generation for expression trees on non-homogeneous register set architectures. It proposes and proves the optimality of an O(n) algorithm f...
231
click to vote
DAM
2011
15 years 1 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
169
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...