119 search results - page 3 / 24 » A relaxed approach to combinatorial problems in robustness a... |
IPCO
2008
13 years 7 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
We consider the robust beamforming problem under imperfect channel state information (CSI) subject to SINR constraints in a downlink multiuser MISO system. One popular approach to...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
In this paper, we consider the problem of geolocating an unknown emitter by a satellite cluster. We formulate the problem as the maximum likelihood location estimation by using TD...
EMNLP
2007
13 years 7 months ago
2007
We consider the problem of learning to parse sentences to lambda-calculus representations of their underlying semantics and present an algorithm that learns a weighted combinatory...
ANTSW
2004
Springer
13 years 11 months ago
2004
Springer
Designing an optimal overlay communication network for a set of processes on the Internet is a central problem of peer-to-peer (P2P) computing. Such a network defines membership a...