Sciweavers

Share
FOCS
2006
IEEE
9 years 4 months ago
New Results for Learning Noisy Parities and Halfspaces
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...
Vitaly Feldman, Parikshit Gopalan, Subhash Khot, A...
FOCS
2006
IEEE
9 years 4 months ago
Index Coding with Side Information
Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer ...
FOCS
2006
IEEE
9 years 4 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
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...
Krzysztof Onak, Pawel Parys
FOCS
2006
IEEE
9 years 4 months ago
Cryptography from Anonymity
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...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
FOCS
2006
IEEE
9 years 4 months ago
Heat Flow and a Faster Algorithm to Compute the Surface Area of a Convex Body
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...
Mikhail Belkin, Hariharan Narayanan, Partha Niyogi
FOCS
2006
IEEE
9 years 4 months ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
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...
Xiaoming Sun, Andrew Chi-Chih Yao
FOCS
2006
IEEE
9 years 4 months ago
Minimum Bounded Degree Spanning Trees
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...
Michel X. Goemans
FOCS
2006
IEEE
9 years 4 months ago
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
Michael Ben-Or, Claude Crépeau, Daniel Gott...
FOCS
2006
IEEE
9 years 4 months ago
Lp metrics on the Heisenberg group and the Goemans-Linial conjecture
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 ...
James R. Lee, Assaf Naor
books