Sciweavers

1118 search results - page 68 / 224
» Convex Optimization
Sort
View
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 4 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
TIP
2010
166views more  TIP 2010»
14 years 11 months ago
Restoration of Poissonian Images Using Alternating Direction Optimization
Much research has been devoted to the problem of restoring Poissonian images, namely for medical and astronomical applications. However, the restoration of these images using state...
Mário A. T. Figueiredo, José M. Biou...
ICML
2006
IEEE
16 years 5 months ago
Maximum margin planning
Mobile robots often rely upon systems that render sensor data and perceptual features into costs that can be used in a planner. The behavior that a designer wishes the planner to ...
Nathan D. Ratliff, J. Andrew Bagnell, Martin Zinke...
SDM
2008
SIAM
133views Data Mining» more  SDM 2008»
15 years 6 months ago
A RELIEF Based Feature Extraction Algorithm
RELIEF is considered one of the most successful algorithms for assessing the quality of features due to its simplicity and effectiveness. It has been recently proved that RELIEF i...
Yijun Sun, Dapeng Wu
NIPS
2001
15 years 6 months ago
Boosting and Maximum Likelihood for Exponential Models
We derive an equivalence between AdaBoost and the dual of a convex optimization problem, showing that the only difference between minimizing the exponential loss used by AdaBoost ...
Guy Lebanon, John D. Lafferty