1/15 Agnostically learning halfspaces FOCS 2005. 2/15 Set X, F class of functions f: X! {0,1}. Efficient Agnostic Learner w.h.p. h: X! {0,1} poly(1/ )
LEARNIN HE UNIFORM UNDER DISTRIBUTION – Toward DNF – Ryan ODonnell Microsoft Research January, 2006.
Learning Juntas Elchanan Mossel UC Berkeley Ryan O’Donnell MIT Rocco Servedio Harvard.
ESA2003 1 On approximating a geometric prize-collecting traveling salesman problem with time windows Reuven Bar-Yehuda – Technion IIT Guy Even – Tel Aviv.
Probabilistically Checkable Proofs Madhu Sudan MIT CSAIL 09/23/20091Probabilistic Checking of Proofs TexPoint fonts used in EMF. Read the TexPoint manual.
Simple Backdoors for RSA Key Generation Scott Dial.
CISS Princeton, March 20081 Optimization via Communication Networks Matthew Andrews Alcatel-Lucent Bell Labs.
Fourier Analysis and Boolean Function Learning Jeff Jackson Duquesne University jackson.
On approximating a geometric prize-collecting traveling salesman problem with time windows
Correlation Immune Functions and Learning
Probabilistically Checkable Proofs
