Sciweavers

15485 search results - page 49 / 3097
» Computing Optimal Subsets
Sort
View
ICML
2004
IEEE
14 years 8 months ago
Multi-task feature and kernel selection for SVMs
We compute a common feature selection or kernel selection configuration for multiple support vector machines (SVMs) trained on different yet inter-related datasets. The method is ...
Tony Jebara
CVPR
2010
IEEE
14 years 1 months ago
Dominant Orientation Templates for Real-Time Detection of Texture-Less Objects
We present a method for real-time 3D object detection that does not require a time consuming training stage, and can handle untextured objects. At its core, is a novel tem- plat...
Stefan Hinterstoisser, Vincent Lepetit, Slobodan I...
PVM
2005
Springer
14 years 1 months ago
Some Improvements to a Parallel Decomposition Technique for Training Support Vector Machines
We consider a parallel decomposition technique for solving the large quadratic programs arising in training the learning methodology Support Vector Machine. At each iteration of th...
Thomas Serafini, Luca Zanni, Gaetano Zanghirati
CORR
2010
Springer
253views Education» more  CORR 2010»
13 years 7 months ago
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCu...
PE
2006
Springer
125views Optimization» more  PE 2006»
13 years 7 months ago
Approximating multi-skill blocking systems by HyperExponential Decomposition
We consider multi-class blocking systems in which jobs require a single processing step. There are groups of servers that can each serve a different subset of all job classes. The...
Geert Jan Franx, Ger Koole, Auke Pot