45 search results - page 6 / 9 » Solving polynomial least squares problems via semidefinite p... |
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
We address the problem of object detection and segmentation using holistic properties of object shape. Global shape representations are highly susceptible to clutter inevitably pr...
ICASSP
2009
IEEE
13 years 5 months ago
2009
IEEE
A unified framework to jointly solve the two problems of localization and synchronization at the same time is presented in this paper. The joint approach is attractive because it ...
SDM
2008
SIAM
13 years 9 months ago
2008
SIAM
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
ISSAC
2007
Springer
14 years 2 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
TSP
2008
13 years 7 months ago
2008
This paper deals with the design of coded waveforms which optimize radar performances in the presence of colored Gaussian disturbance. We focus on the class of linearly coded puls...