134
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We study the spectral norm of matrices M that can be factored as M = BA, where A is a random matrix with independent mean zero entries and B is a fixed matrix. Under the (4 + )-th ...
98
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
158
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
147
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
124
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitmen...
94
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
103
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
In this paper, we study the problem of learning phylogenies and hidden Markov models. We call the Markov model nonsingular if all transtion matrices have determinants bounded away...
94
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
99
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
138
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...