Sciweavers

1850 search results - page 321 / 370
» classification 2010
Sort
View
BMVC
2010
15 years 1 months ago
StyP-Boost: A Bilinear Boosting Algorithm for Learning Style-Parameterized Classifiers
We introduce a novel bilinear boosting algorithm, which extends the multi-class boosting framework of JointBoost to optimize a bilinear objective function. This allows style param...
Jonathan Warrell, Philip H. S. Torr, Simon Prince
COLT
2010
Springer
15 years 1 months ago
Nonparametric Bandits with Covariates
We consider a bandit problem which involves sequential sampling from two populations (arms). Each arm produces a noisy reward realization which depends on an observable random cov...
Philippe Rigollet, Assaf Zeevi
CORR
2010
Springer
77views Education» more  CORR 2010»
15 years 1 months ago
Implicit Renewal Theory and Power Tails on Trees
: We extend Goldie's (1991) Implicit Renewal Theorem to enable the analysis of recursions on weighted branching trees. We illustrate the developed method by deriving the power...
Predrag R. Jelenkovic, Mariana Olvera-Cravioto
CORR
2010
Springer
110views Education» more  CORR 2010»
15 years 1 months ago
Learning Multi-modal Similarity
In many applications involving multi-media data, the definition of similarity between items is integral to several key tasks, including nearest-neighbor retrieval, classification,...
Brian McFee, Gert R. G. Lanckriet
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 1 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker