APPROX 2010 - PDF Preprint Papers

APPROX 2010 International Workshop on Approximation Algorithms for

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed APPROX-2010 Paper

click to vote

APPROX
2010
Springer

297views Algorithms» more APPROX 2010»

Approximating Linear Threshold Predicates

13 years 6 months ago

Download www.csc.kth.se

We study constraint satisfaction problems on the domain {-1, 1}, where the given constraints are homogeneous linear threshold predicates. That is, predicates of the form sgn(w1x1 +...

Mahdi Cheraghchi, Johan Håstad, Marcus Isaks...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	297	Approximating Linear Threshold Predicates	claim
2	220	Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs	claim
3	213	Constructive Proofs of Concentration Bounds	claim
4	207	Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses	claim
5	193	Approximation Algorithms for the Directed k-Tour and k-Stroll Problems	claim
6	189	Approximating Sparsest Cut in Graphs of Bounded Treewidth	claim
7	188	Approximation Algorithms for Reliable Stochastic Combinatorial Optimization	claim
8	179	Rumor Spreading on Random Regular Graphs and Expanders	claim
9	176	Approximation Algorithms for Min-Max Generalization Problems	claim
10	168	Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners	claim
11	168	Differential Privacy and the Fat-Shattering Dimension of Linear Queries	claim
12	160	Proximity Algorithms for Nearly-Doubling Spaces	claim
13	154	The Checkpoint Problem	claim
14	150	Reconstruction Threshold for the Hardcore Model	claim
15	148	Learning and Lower Bounds for AC0 with Threshold Gates	claim
16	147	Approximate Lasserre Integrality Gap for Unique Games	claim
17	146	Delaying Satisfiability for Random 2SAT	claim
18	139	Two-Source Extractors Secure against Quantum Adversaries	claim
19	138	Improved Rounding for Parallel Repeated Unique Games	claim
20	138	Maximum Flows on Disjoint Paths	claim
21	138	The Euclidean Distortion of Flat Tori	claim
22	137	Online Embeddings	claim
23	136	Vertex Sparsifiers: New Results from Old Techniques	claim
24	135	Monotonicity Testing and Shortest-Path Routing on the Cube	claim
25	133	Periodicity in Streams	claim
26	133	Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries	claim
27	133	Liftings of Tree-Structured Markov Chains - (Extended Abstract)	claim
28	132	Relativized Worlds without Worst-Case to Average-Case Reductions for NP	claim
29	131	Testing Boolean Function Isomorphism	claim
30	131	A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field	claim
31	123	Better Gap-Hamming Lower Bounds via Better Round Elimination	claim
32	120	Improved Pseudorandom Generators for Depth 2 Circuits	claim
33	120	Uniform Derandomization from Pathetic Lower Bounds	claim
34	118	Better Size Estimation for Sparse Matrix Products	claim
35	112	Submodular Secretary Problem and Extensions	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers