FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
Mixtures of Gaussians are among the most fundamental and widely used statistical models. Current techniques for learning such mixtures from data are local search heuristics with w...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
We study two widely used algorithms, Glauber dynamics and the Swendsen-Wang algorithm, on rectangular subsets of the hypercubic lattice
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
We study the phenomenon of cognitive learning from an algorithmic standpoint. How does the brain effectively learn concepts from a small number of examples despite the fact that e...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE