Sciweavers

2177 search results - page 382 / 436
» Relative Margin Machines
Sort
View
COLT
1993
Springer
14 years 28 days ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
14 years 27 days 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
ECLIPSE
2007
ACM
14 years 22 days ago
Predicting buggy changes inside an integrated development environment
We present a tool that predicts whether the software under development inside an IDE has a bug. An IDE plugin performs this prediction, using the Change Classification technique t...
Janaki T. Madhavan, E. James Whitehead Jr.
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
14 years 17 days ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
DSMML
2004
Springer
14 years 16 days ago
Efficient Communication by Breathing
The arithmetic-coding-based communication system, Dasher, can be driven by a one-dimensional continuous signal. A belt-mounted breath-mouse, delivering a signal related to lung vol...
Tom Shorrock, David MacKay, Chris Ball