213 search results - page 14 / 43 » Semidefinite programming |
FSTTCS
2001
Springer
14 years 1 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
ICASSP
2009
IEEE
14 years 3 months ago
2009
IEEE
The problem of node localization in a wireless sensor network (WSN) with the use of the incomplete and noisy distance measurements between nodes as well as anchor position informa...
ICASSP
2011
IEEE
13 years 9 days ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
DAGM
2004
Springer
14 years 2 months ago
2004
Springer
DATE
2010
IEEE
14 years 1 months ago
2010
IEEE
