Approximating Linear Threshold Predicates

15 years 4 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

Real-time Traffic

Algorithms | APPROX 2010 | Approximation Curve | Homogeneous Linear Threshold | Threshold Predicates |

claim paper

Related Content

» On Quadratic Threshold CSPs

» Improved Approximation of Linear Threshold Functions

» Every Linear Threshold Function has a LowWeight Approximator

» Lower Bounds on the VapnikChervonenkis Dimension of MultiLayer Threshold Networks

» Nearly optimal solutions for the chow parameters problem and lowweight approximation of ha...

» On the Complexity of Join Predicates

» Gadgets Approximation and Linear Programming

» Parametric Query Optimization for Linear and Piecewise Linear Cost Functions

» Image Denoising in Mixed PoissonGaussian Noise

Post Info
More Details (n/a)

Added	26 Oct 2010
Updated	26 Oct 2010
Type	Conference
Year	2010
Where	APPROX
Authors	Mahdi Cheraghchi, Johan Håstad, Marcus Isaksson, Ola Svensson

Comments (0)

Sciweavers

Approximating Linear Threshold Predicates

Algorithms | APPROX 2010 | Approximation Curve | Homogeneous Linear Threshold | Threshold Predicates |

Explore & Download

Productivity Tools

Sciweavers