Sciweavers

29 search results - page 5 / 6
» Learning parities in the mistake-bound model
Sort
View
ICPPW
2006
IEEE
14 years 1 months ago
m-LPN: An Approach Towards a Dependable Trust Model for Pervasive Computing Applications
Trust, the fundamental basis of ‘cooperation’ – one of the most important characteristics for the performance of pervasive ad hoc network-- is under serious threat with the ...
Munirul M. Haque, Sheikh Iqbal Ahamed
FOCS
2008
IEEE
14 years 1 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
ML
1998
ACM
13 years 7 months ago
On Restricted-Focus-of-Attention Learnability of Boolean Functions
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jac...
IJCAI
2007
13 years 8 months ago
Learning from Partial Observations
We present a general machine learning framework for modelling the phenomenon of missing information in data. We propose a masking process model to capture the stochastic nature of...
Loizos Michael
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
13 years 11 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns