2244 search results - page 49 / 449 » A new heuristic approach for non-convex optimization problem... |
165
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Detecting contour closure, i.e., finding a cycle of disconnected contour fragments that separates an object from its background, is an important problem in perceptual gro...
182
click to vote
ICIP
1997
IEEE
16 years 7 months ago
1997
IEEE
In this paper we introduce a novel optimization framework for hierarchical data clustering and apply it to the problem of unsupervised texture segmentation. The proposed objective...
155
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract-In this paper, a new preemption policy is proposed and complemented with an adaptive scheme that aims to minimize rerouting. The preemption policy combines the three main ...
139
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Email Retrieval task has recently taken much attention to help the user retrieve the email(s) related to the submitted query. Up to our knowledge, existing email retrieval ranking...
162
click to vote
DATE
2007
IEEE
16 years 13 days ago
2007
IEEE
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...