1118 search results - page 129 / 224 » Convex Optimization |
ICIP
2005
IEEE
14 years 11 months ago
2005
IEEE
Restoring binary images is a problem which arises in various application fields. In our paper, this problem is considered in a variational framework: the sought-after solution min...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
JCT
2011
13 years 4 months ago
2011
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
BROADNETS
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract-- Optical Networks with wavelength routing are expected to form the backbone in the next generation wide area networks. The traffic grooming problem in optical networks is...
CVPR
1998
IEEE
14 years 11 months ago
1998
IEEE
We propose a methodfor segmenting gray-value images. By segmentation, we mean a map from the set of pixels to a small set of levels such that each connected component of the set o...