2252 search results - page 113 / 451 » Lower Bounds for Dynamic Algorithms |
106
click to vote
ECCC
2010
15 years 3 months ago
2010
We introduce a new approach to characterizing the unobserved portion of a distribution, which provides sublinear-sample additive estimators for a class of properties that includes...
145
click to vote
INFOCOM
2000
IEEE
15 years 7 months ago
2000
IEEE
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
136
Voted
COCOA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Multiple sequence alignment (MSA) is one of the most basic and central tasks for many studies in modern biology. In this paper, we present a new progressive alignment alg...
115
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
120
click to vote
FOCS
1990
IEEE
15 years 7 months ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...