3020 search results - page 188 / 604 » Optimal partition trees |
185
click to vote
COREGRID
2007
Springer
16 years 22 days ago
2007
Springer
This paper deals with the replica placement problem on fully homogeneous tree networksknownasthe Replica Placementoptimizationproblem. Theclient requests are known beforehand, whil...
167
click to vote
SODA
1994
ACM
15 years 7 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
194
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
195
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
We address the problem of robust clustering by combining data partitions (forming a clustering ensemble) produced by multiple clusterings. We formulate robust clustering under an ...
152
click to vote
ICEBE
2007
IEEE
16 years 26 days ago
2007
IEEE
This paper investigates profit optimisation by the partitioning of server pools. Different types of web requests are considered in this paper: best-effort requests and multi-class...