FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
We prove that the function d : R3 × R3 → [0, ∞) given by d (x, y, z), (t, u, v) = (t − x)2 + (u − y)2 2 + (v − z + 2xu − 2yt)2 1 2 + (t − x)2 + (u − y)2 1 2 . is ...
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
Let Λ : {0, 1}n ×{0, 1}m → {0, 1} be a Boolean formula of size d, or more generally, an arithmetic circuit of degree d, known to both Alice and Bob, and let y ∈ {0, 1}m be a...
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
We put forward a first definition of general secure computation that, without any trusted set-up, • handles an arbitrary number of concurrent executions; and • is implementa...
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE