Sciweavers

3406 search results - page 65 / 682
» Computational models of classical conditioning
Sort
View
STACS
2012
Springer
14 years 1 months ago
The Denjoy alternative for computable functions
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
Laurent Bienvenu, Rupert Hölzl, Joseph S. Mil...
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
16 years 6 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
NIPS
2003
15 years 7 months ago
Margin Maximizing Loss Functions
Margin maximizing properties play an important role in the analysis of classi£cation models, such as boosting and support vector machines. Margin maximization is theoretically in...
Saharon Rosset, Ji Zhu, Trevor Hastie
CORR
2010
Springer
171views Education» more  CORR 2010»
15 years 1 months ago
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
Cem Tekin, Mingyan Liu
CLASSIFICATION
2004
59views more  CLASSIFICATION 2004»
15 years 6 months ago
Oscillation Heuristics for the Two-group Classification Problem
: We propose a new nonparametric family of oscillation heuristics for improving linear classifiers in the two-group discriminant problem. The heuristics are motivated by the intuit...
Ognian Asparouhov, Paul A. Rubin