Sciweavers

1576 search results - page 86 / 316
» Properties of Synthetic Optimization Problems
Sort
View
PAMI
2011
13 years 5 months ago
Cost-Sensitive Boosting
—A novel framework is proposed for the design of cost-sensitive boosting algorithms. The framework is based on the identification of two necessary conditions for optimal cost-sen...
Hamed Masnadi-Shirazi, Nuno Vasconcelos
CVPR
2008
IEEE
15 years 1 days ago
A polynomial-time bound for matching and registration with outliers
We present a framework for computing optimal transformations, aligning one point set to another, in the presence of outliers. Example applications include shape matching and regis...
Carl Olsson, Olof Enqvist, Fredrik Kahl
NIPS
2008
13 years 11 months ago
Robust Regression and Lasso
We consider robust least-squares regression with feature-wise disturbance. We show that this formulation leads to tractable convex optimization problems, and we exhibit a particul...
Huan Xu, Constantine Caramanis, Shie Mannor
ACSD
2007
IEEE
88views Hardware» more  ACSD 2007»
14 years 4 months ago
Testing the executability of scenarios in general inhibitor nets
In this paper we introduce executions of place/transition Petri nets with weighted inhibitor arcs (PTI-net) as enabled labeled stratified order structures (LSOs) and present a po...
Robert Lorenz, Sebastian Mauser, Robin Bergenthum
AAAI
2011
12 years 10 months ago
A Feasible Nonconvex Relaxation Approach to Feature Selection
Variable selection problems are typically addressed under a penalized optimization framework. Nonconvex penalties such as the minimax concave plus (MCP) and smoothly clipped absol...
Cuixia Gao, Naiyan Wang, Qi Yu, Zhihua Zhang