Sciweavers

122 search results - page 24 / 25
» Kernelization for Convex Recoloring
Sort
View
95
Voted
CORR
2010
Springer
163views Education» more  CORR 2010»
14 years 11 months ago
Faster Rates for training Max-Margin Markov Networks
Structured output prediction is an important machine learning problem both in theory and practice, and the max-margin Markov network (M3 N) is an effective approach. All state-of-...
Xinhua Zhang, Ankan Saha, S. V. N. Vishwanathan
94
Voted
ICIP
2009
IEEE
14 years 11 months ago
An attention model for extracting components that merit identification
Cognitive systems are trained to recognise perceptually meaningful parts of an image. These regions contain some variation, i.e. local texture, and are roughly convex. We call suc...
Mohammad Jahangiri, Maria Petrou
104
Voted
CVPR
2008
IEEE
16 years 3 months ago
Margin-based discriminant dimensionality reduction for visual recognition
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...
Hakan Cevikalp, Bill Triggs, Frédéri...
121
Voted
ESANN
2004
15 years 2 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
91
Voted
IOR
2002
112views more  IOR 2002»
15 years 23 days ago
Interdisciplinary Meandering in Science
abstract mathematics. My mentor was Professor S. Bochner, a distinguished contributor to harmonic analysis. My classmates included Richard Bellman (who later nurtured the method of...
Samuel Karlin