2030 search results - page 193 / 406 » Extremal Problems of Information Combining |
153
Voted
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
157
click to vote
ICDM
2009
IEEE
16 years 24 days ago
2009
IEEE
—We consider the problem of learning a linear combination of pre-specified kernel matrices in the Fisher discriminant analysis setting. Existing methods for such a task impose a...
172
click to vote
ICASSP
2008
IEEE
16 years 18 days ago
2008
IEEE
This paper presents a novel method for stereo matching with occlusion handling. In order to estimate optimal cost, we define an energy function and solve the iterative equation w...
164
click to vote
IJCNN
2008
IEEE
16 years 17 days ago
2008
IEEE
Abstract— Meta-learning helps us find solutions to computational intelligence (CI) challenges in automated way. Metalearning algorithm presented in this paper is universal and m...
153
Voted
CAI
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...