Sciweavers

16188 search results - page 8 / 3238
» The Optimal PAC Algorithm
Sort
View
ICS
2010
Tsinghua U.
14 years 4 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
TSP
2012
12 years 3 months ago
Sensing and Probing Cardinalities for Active Cognitive Radios
—In a cognitive radio network, opportunistic spectrum access (OSA) to the underutilized spectrum involves not only sensing the spectrum occupancy but also probing the channel qua...
Thang Van Nguyen, Hyundong Shin, Tony Q. S. Quek, ...
COLT
2004
Springer
14 years 27 days ago
Concentration Bounds for Unigrams Language Model
Abstract. We show several PAC-style concentration bounds for learning unigrams language model. One interesting quantity is the probability of all words appearing exactly k times in...
Evgeny Drukh, Yishay Mansour
ESOP
2004
Springer
14 years 26 days ago
Linear Types for Packet Processing
Abstract. We present PacLang: an imperative, concurrent, linearlytyped language designed for expressing packet processing applications. PacLang’s linear type system ensures that ...
Robert Ennals, Richard Sharp, Alan Mycroft
JMLR
2006
117views more  JMLR 2006»
13 years 7 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon