2252 search results - page 192 / 451 » Lower Bounds for Dynamic Algorithms |
159
Voted
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
117
click to vote
RSA
1998
15 years 3 months ago
1998
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
113
click to vote
IJSYSC
1998
15 years 3 months ago
1998
This paper presents a new analysis and design method for model reference adaptive control(MRAC) with arbitrary bounded input nonlinearities. The adaptive algorithm ensures that th...
152
Voted
SECON
2007
IEEE
15 years 10 months ago
2007
IEEE
—In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communicat...
125
Voted
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...