2252 search results - page 172 / 451 » Lower Bounds for Dynamic Algorithms |
116
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
143
click to vote
SPAA
2009
ACM
16 years 21 days ago
2009
ACM
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
128
click to vote
COCOON
2009
Springer
15 years 10 months ago
2009
Springer
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...
131
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper, the space requirements for the OBDD representation of certain graph classes, specifically cographs, several types of graphs with few P4s, unit interval gr...
102
Voted
COLT
2004
Springer
15 years 9 months ago
2004
Springer
We give the first polynomial time prediction strategy for any PAC-learnable class C that probabilistically predicts the target with mistake probability poly(log(t)) t = ˜O 1 t w...