2252 search results - page 333 / 451 » Lower Bounds for Dynamic Algorithms |
150
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper is concerned with studying how the minimum power loss in a power system is related to its network topology. The existing algorithms in the literature all exploit nonline...
138
click to vote
CORR
2012
Springer
13 years 11 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
192
click to vote
PODS
2009
ACM
16 years 3 months ago
2009
ACM
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
162
Voted
ALT
2002
Springer
16 years 8 days ago
2002
Springer
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
125
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...