Sciweavers

729 search results - page 2 / 146
» And Or Hierarchies and Round Abstraction
Sort
View
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 7 months ago
Vertex Sparsifiers and Abstract Rounding Algorithms
Moses Charikar, Tom Leighton, Shi Li, Ankur Moitra
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 7 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
CACM
2000
94views more  CACM 2000»
13 years 6 months ago
Abstract Class Hierarchies, Factories, and Stable Designs
Class Hierarchies, Factories, and Stable Designs M uch of the debate about the general aptness of class hierarchies is rooted in the different objectives taxonomists and implemente...
Friedrich Steimann
STOC
2009
ACM
98views Algorithms» more  STOC 2009»
14 years 7 months ago
Sherali-adams relaxations of the matching polytope
We study the Sherali-Adams lift-and-project hierarchy of linear programming relaxations of the matching polytope. Our main result is an asymptotically tight expression 1 + 1/k for...
Claire Mathieu, Alistair Sinclair
INFOCOM
1998
IEEE
13 years 11 months ago
Distributed Top-Down Hierarchy Construction
ABSTRACT: Hierarchies provide scalability in large networks and are integral to many widely-used protocols and applications. Previous approaches to constructing hierarchies have ty...
David Thaler, Chinya V. Ravishankar