3020 search results - page 31 / 604 » Optimal partition trees |
219
Voted
ICDT
2009
ACM
16 years 4 months ago
2009
ACM
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
137
Voted
EGH
2005
Springer
15 years 9 months ago
2005
Springer
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
143
Voted
DEXA
2008
Springer
15 years 5 months ago
2008
Springer
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...
118
click to vote
EMNLP
2007
15 years 5 months ago
2007
This paper provides an algorithmic framework for learning statistical models involving directed spanning trees, or equivalently non-projective dependency structures. We show how p...
110
click to vote
ICDM
2003
IEEE
15 years 8 months ago
2003
IEEE
We propose a novel clustering algorithm that is similar in spirit to classification trees. The data is recursively split using a criterion that applies a discrete curve evolution...