In this semitutorial paper, a comprehensive survey of closest point search methods for
lattices without a regular structure is presented. The existing search strategies are described …

On the Unique Games Conjecture Page 1 On the Unique Games Conjecture Subhash Khot
Courant Institute of Mathematical Sciences, NYU ∗ Abstract This article surveys recently …

This is the first comprehensive introduction to Support Vector Machines (SVMs), a new
generation learning system based on recent advances in statistical learning theory. SVMs …

The idea for this book was conceived over the second bottle of Villa Maria's Caber net
Medot'89, at the dinner of the Australasian Combinatorics Conference held at Palmerston …

We show that every language in NP has a probablistic verifier that checks membership
proofs for it using logarithmic number of random bits and by examining a constant number of …

Approximation algorithms have developed in response to the impossibility of solving a great
variety of important optimization problems. Too frequently, when attempting to get a solution …

Many of the classification algorithms developed in the machine learning literature, including
the support vector machine and boosting, can be viewed as minimum contrast methods that …

N COMPUTER applications we are used to live with approximation. Var I ious notions of
approximation appear, in fact, in many circumstances. One notable example is the type of …

We give a new characterization of NP: the class NP contains exactly those languages L for
which membership proofs (a proof that an input x is in L) can be verified probabilistically in …

We investigate the computational complexity of two closely related classes of combinatorial
optimization problems for linear systems which arise in various fields such as machine …