56 search results - page 1 / 12 » A Feasible Nonconvex Relaxation Approach to Feature Selectio... |
99
Voted
AAAI
2011
13 years 9 months ago
2011
Variable selection problems are typically addressed under a penalized optimization framework. Nonconvex penalties such as the minimax concave plus (MCP) and smoothly clipped absol...
91
Voted
CVPR
2011
IEEE
14 years 1 months ago
2011
IEEE
Dictionary learning is a challenging theme in computer vision. The basic goal is to learn a sparse representation from an overcomplete basis set. Most existing approaches employ a...
96
Voted
MP
2007
14 years 9 months ago
2007
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branc...
90
Voted
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
— In this paper, we propose a path planning method for nonholonomic multi-vehicle system in presence of moving obstacles. The objective is to find multiple fixed length paths f...
92
Voted
ACML
2009
Springer
15 years 1 months ago
2009
Springer
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...