356 search results - page 49 / 72 » Parallelizing time with polynomial circuits |
112
click to vote
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
111
click to vote
STACS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
128
click to vote
ICDCSW
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper we focus on the design of high performance peer-to-peer content sharing systems. In particular, our goal is to achieve global load balancing and short user-request r...
90
Voted
ALGORITHMICA
2010
14 years 12 months ago
2010
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
92
Voted
GLVLSI
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper, we present an approved linear-time algorithm for statistical leakage analysis in the present of any spatial correlation condition (strong or weak). The new algorith...