2168 search results - page 193 / 434 » Randomized Algorithms and Complexity Theory |
148
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
112
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Proportional integral derivative (PID) controller tuning is an area of interest for researchers in many disciplines of science and engineering. This paper presents a new algorithm...
122
click to vote
PODS
2010
ACM
15 years 8 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
218
Voted
STOC
1993
ACM
15 years 7 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
150
Voted
COMPUTING
2008
15 years 3 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...