FOCS
2006
IEEE
14 years 5 months ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
FOCS
2006
IEEE
14 years 5 months ago
2006
IEEE
FOCS
2006
IEEE
14 years 5 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
FOCS
2006
IEEE
14 years 5 months ago
2006
IEEE
FOCS
2006
IEEE
14 years 5 months ago
2006
IEEE
There is a vast body of work on implementing anonymous communication. In this paper, we study the possibility of using anonymous communication as a building block, and show that o...
FOCS
2006
IEEE
14 years 5 months ago
2006
IEEE
We draw on the observation that the amount of heat diffusing outside of a heated body in a short period of time is proportional to its surface area, to design a simple algorithm f...
FOCS
2006
IEEE
14 years 5 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
FOCS
2006
IEEE
14 years 5 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
FOCS
2006
IEEE
14 years 5 months ago
2006
IEEE
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
FOCS
2006
IEEE
14 years 5 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 ...