2084 search results - page 204 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
123
click to vote
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
111
click to vote
COLT
1999
Springer
15 years 6 months ago
1999
Springer
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
155
click to vote
ASPDAC
2008
ACM
15 years 4 months ago
2008
ACM
In the nanometer manufacturing region, process variation causes significant uncertainty for circuit performance verification. Statistical static timing analysis (SSTA) is thus dev...
116
Voted
GD
2008
Springer
15 years 3 months ago
2008
Springer
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a c...
184
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...