65 search results - page 13 / 13 » Uniform Derandomization from Pathetic Lower Bounds |
HICSS
2007
IEEE
13 years 11 months ago
2007
IEEE
A key enabler of the recently adopted, assemblycentric development approach for distributed real-time software systems is QoS-enabled middleware, which provides reusable building ...
BMCBI
2010
13 years 5 months ago
2010
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
SWAT
2000
Springer
13 years 9 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
COMBINATORICA
2007
13 years 5 months ago
2007
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
TIT
2008
13 years 5 months ago
2008
We study the task of transforming a hard function f, with which any small circuit disagrees on (1 - )/2 fraction of the input, into a harder function f , with which any small circ...