2252 search results - page 274 / 451 » Lower Bounds for Dynamic Algorithms |
91
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In this paper, the problem of estimating the damping factor and frequency parameters from multiple cisoids in noise is addressed. We rst propose a data matrix which generalizes th...
135
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
118
Voted
STOC
2003
ACM
16 years 3 months ago
2003
ACM
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
144
click to vote
INFOCOM
2002
IEEE
15 years 8 months ago
2002
IEEE
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
156
Voted
DC
2008
15 years 3 months ago
2008
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...