3020 search results - page 91 / 604 » Optimal partition trees |
188
Voted
ALDT
2009
Springer
16 years 22 days ago
2009
Springer
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
173
click to vote
ICS
2007
Tsinghua U.
16 years 8 days ago
2007
Tsinghua U.
Overlapping communication with computation is an important optimization on current cluster architectures; its importance is likely to increase as the doubling of processing power ...
162
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
169
click to vote
ICALP
2000
Springer
15 years 9 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
184
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...