560 search results - page 75 / 112 » Level-set methods for convex optimization |
139
click to vote
ICC
2009
IEEE
15 years 10 months ago
2009
IEEE
—In this paper we propose a new low feedback and low complexity scheme that adjusts the phases at the relays, thus allowing for the coherent combining of signals from multiple re...
122
click to vote
ISCAS
2003
IEEE
15 years 8 months ago
2003
IEEE
Quadraturemirror filter(QMF)bank with multi-criterion constraints suchas minimal aliasing and/or minimal error coding is amongthe most important problems in filter bank design, fo...
146
click to vote
ACML
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
116
click to vote
ATMOS
2010
15 years 2 months ago
2010
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
153
click to vote
ICCV
2011
IEEE
14 years 3 months ago
2011
IEEE
In this paper, we show that tracking multiple people whose paths may intersect can be formulated as a convex global optimization problem. Our proposed framework is designed to exp...