164
click to vote
COLT
1995
Springer
15 years 7 months ago
1995
Springer
We investigate the problem of estimating the proportion vector which maximizes the likelihood of a given sample for a mixture of given densities. We adapt a framework developed for...
86
Voted
COLT
1995
Springer
15 years 7 months ago
1995
Springer
140
click to vote
COLT
1995
Springer
15 years 7 months ago
1995
Springer
In this paper, we study PAC-leaming algorithms for specialized classes of deterministic finite automata (DFA). Inpartictdar, we study branchingprogrsms, and we investigate the int...
172
click to vote
STOC
2000
ACM
15 years 7 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...