Sciweavers

16188 search results - page 5 / 3238
» The Optimal PAC Algorithm
Sort
View
IPL
2010
92views more  IPL 2010»
13 years 6 months ago
Learning parities in the mistake-bound model
We study the problem of learning parity functions that depend on at most k variables (kparities) attribute-efficiently in the mistake-bound model. We design a simple, deterministi...
Harry Buhrman, David García-Soriano, Arie M...
VLSISP
2008
159views more  VLSISP 2008»
13 years 7 months ago
Effective Code Generation for Distributed and Ping-Pong Register Files: A Case Study on PAC VLIW DSP Cores
The compiler is generally regarded as the most important software component that supports a processor design to achieve success. This paper describes our application of the open re...
Yung-Chia Lin, Chia-Han Lu, Chung-Ju Wu, Chung-Lin...
ALT
1999
Springer
13 years 11 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
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 7 months ago
PAC Learning Mixtures of Axis-Aligned Gaussians with No Separation Assumption
Abstract. We propose and analyze a new vantage point for the learning of mixtures of Gaussians: namely, the PAC-style model of learning probability distributions introduced by Kear...
Jon Feldman, Ryan O'Donnell, Rocco A. Servedio
FOCS
2006
IEEE
14 years 1 months ago
Cryptographic Hardness for Learning Intersections of Halfspaces
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness...
Adam R. Klivans, Alexander A. Sherstov