2084 search results - page 390 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
ACL
1994
14 years 11 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
The concept of the Bayesian optimal single threshold is a well established and widely used classification technique. In this paper, we prove that when spatial cohesion is assumed ...
ICFP
2010
ACM
14 years 10 months ago
2010
ACM
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. Differential privacy offers a strong statistical guar...
84
Voted
ML
2006
ACM
14 years 9 months ago
2006
ACM
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...