Sciweavers

ECCC
2006
80views more  ECCC 2006»
13 years 11 months ago
Packing to angles and sectors
In our problem we are given a set of customers, their positions on the plane and their demands. Geometrically, the area covered by a directional antenna with parameters , ,
Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasivis...
ECCC
2006
51views more  ECCC 2006»
13 years 11 months ago
Formula Caching in DPLL
Paul Beame, Russell Impagliazzo, Toniann Pitassi, ...
ECCC
2006
77views more  ECCC 2006»
13 years 11 months ago
Extractors and condensers from univariate polynomials
We give new constructions of randomness extractors and lossless condensers that are optimal to within constant factors in both the seed length and the output length. For extractor...
Venkatesan Guruswami, Christopher Umans, Salil P. ...
ECCC
2006
218views more  ECCC 2006»
13 years 11 months ago
Efficient Algorithms for Online Game Playing and Universal Portfolio Management
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
Amit Agarwal, Elad Hazan
ECCC
2006
97views more  ECCC 2006»
13 years 11 months ago
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...
Frank Neumann, Carsten Witt
ECCC
2006
70views more  ECCC 2006»
13 years 11 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas
ECCC
2006
90views more  ECCC 2006»
13 years 11 months ago
Comparing Reductions to NP-Complete Sets
Under the assumption that NP does not have p-measure 0, we investigate reductions to NP-complete sets and prove the following: (1) Adaptive reductions are more powerful than nonad...
John M. Hitchcock, Aduri Pavan
ECCC
2006
84views more  ECCC 2006»
13 years 11 months ago
The Complexity of Forecast Testing
Lance Fortnow, Rakesh Vohra
ECCC
2006
134views more  ECCC 2006»
13 years 11 months ago
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
Avi Wigderson, David Xiao