299 search results - page 25 / 60 » A Convex Relaxation Approach for Computing Minimal Partition... |
DATE
2006
IEEE
15 years 3 months ago
2006
IEEE
Partitioning is a time consuming and computationally complex optimization problem in the codesign of hardware software systems. The stringent time-to-market requirements have resu...
SIAMJO
2008
14 years 9 months ago
2008
We propose a new iterative approach for solving linear programs over convex cones. Assuming that Slaters condition is satisfied, the conic problem is transformed to the minimizatio...
CVPR
2010
IEEE
15 years 5 days ago
2010
IEEE
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
ACCV
2007
Springer
15 years 1 months ago
2007
Springer
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...