613 search results - page 40 / 123 » Time Optimal Self-Stabilizing Spanning Tree Algorithms |
STOC
1995
ACM
15 years 1 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...
MSV
2004
14 years 11 months ago
2004
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
89
Voted
BMCBI
2006
14 years 9 months ago
2006
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...
ICIP
2009
IEEE
14 years 7 months ago
2009
IEEE
We propose a region-based method to extract semantic foreground regions from color video sequences with static backgrounds. First, we introduce a new distance measure for backgrou...
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...