Sciweavers

581 search results - page 64 / 117
» Nonstationary kernel combination
Sort
View
PRL
2008
133views more  PRL 2008»
13 years 8 months ago
Better multiclass classification via a margin-optimized single binary problem
We develop a new multiclass classification method that reduces the multiclass problem to a single binary classifier (SBC). Our method constructs the binary problem by embedding sm...
Ran El-Yaniv, Dmitry Pechyony, Elad Yom-Tov
ICCV
2007
IEEE
14 years 3 months ago
Learning The Discriminative Power-Invariance Trade-Off
We investigate the problem of learning optimal descriptors for a given classification task. Many hand-crafted descriptors have been proposed in the literature for measuring visua...
Manik Varma, Debajyoti Ray
CVPR
2005
IEEE
14 years 2 months ago
Nonlinear Face Recognition Based on Maximum Average Margin Criterion
This paper proposes a novel nonlinear discriminant analysis method named by Kernerlized Maximum Average Margin Criterion (KMAMC), which has combined the idea of Support Vector Mac...
Baochang Zhang, Xilin Chen, Shiguang Shan, Wen Gao
CP
2005
Springer
14 years 2 months ago
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
Grégoire Dooms, Yves Deville, Pierre Dupont
ESA
2004
Springer
103views Algorithms» more  ESA 2004»
14 years 2 months ago
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
Michael R. Fellows, Christian Knauer, Naomi Nishim...