Sciweavers

978 search results - page 29 / 196
» Knowledge, Probability, and Adversaries
Sort
View
ALT
1999
Springer
15 years 2 months ago
PAC Learning with Nasty Noise
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz
FAST
2008
15 years 2 days ago
Portably Solving File TOCTTOU Races with Hardness Amplification
The file-system API of contemporary systems makes programs vulnerable to TOCTTOU (time of check to time of use) race conditions. Existing solutions either help users to detect the...
Dan Tsafrir, Tomer Hertz, David Wagner, Dilma Da S...
ICASSP
2010
IEEE
14 years 10 months ago
A minimax approach to Bayesian estimation with partial knowledge of the observation model
We address the problem of Bayesian estimation where the statistical relation between the signal and measurements is only partially known. We propose modeling partial Baysian knowl...
Tomer Michaeli, Yonina C. Eldar
IAT
2006
IEEE
15 years 3 months ago
Using Prior Knowledge to Improve Distributed Hill Climbing
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
Roger Mailler
KDD
2008
ACM
162views Data Mining» more  KDD 2008»
15 years 10 months ago
Composition attacks and auxiliary information in data privacy
Privacy is an increasingly important aspect of data publishing. Reasoning about privacy, however, is fraught with pitfalls. One of the most significant is the auxiliary informatio...
Srivatsava Ranjit Ganta, Shiva Prasad Kasiviswanat...