Sciweavers

288 search results - page 15 / 58
» Inclusion Problems for Patterns with a Bounded Number of Var...
Sort
View
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 6 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
ECCC
2011
185views ECommerce» more  ECCC 2011»
13 years 2 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef
INFORMS
2000
54views more  INFORMS 2000»
13 years 7 months ago
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
Marjan van den Akker, Cor A. J. Hurkens, Martin W....
CISS
2011
IEEE
12 years 11 months ago
Noncoherent compressive sensing with application to distributed radar
—We consider a multi-static radar scenario with spatially dislocated receivers that can individually extract delay information only. Furthermore, we assume that the receivers are...
Christian R. Berger, Josee M. F. Moura
STOC
2001
ACM
116views Algorithms» more  STOC 2001»
14 years 8 months ago
One line and n points
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
Bernd Gärtner, József Solymosi, Falk T...