121 search results - page 9 / 25 » Upper Bounds on Number of Steals in Rooted Trees |
CCCG
2010
14 years 11 months ago
2010
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...
177
click to vote
VLDB
2005
ACM
15 years 9 months ago
2005
ACM
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
68
Voted
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
TIT
2011
14 years 4 months ago
2011
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Following a number of recent papers investigating the possibility of optimal comparison-based optimization algorithms for a given distribution of probability on fitness functions...