3020 search results - page 282 / 604 » Optimal partition trees |
153
click to vote
SOFSEM
1997
Springer
15 years 11 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
179
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
198
click to vote
AAAI
2007
15 years 9 months ago
2007
The future success of application layer video multicast depends on the availability of video stream distribution methods that can scale in the number of stream senders and receive...
194
click to vote
IJCAI
2003
15 years 8 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
144
click to vote
MST
2006
15 years 6 months ago
2006
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...