337 search results - page 22 / 68 » Semidefinite Programming Based Approximation Algorithms |
165
click to vote
TSP
2012
14 years 13 hour ago
2012
Abstract—We consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive...
183
click to vote
TKDE
2012
13 years 6 months ago
2012
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
137
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
130
Voted
ICASSP
2009
IEEE
15 years 11 months ago
2009
IEEE
In this work we propose a methodology for document reconstruction based on dynamic programming and a modified version of the Prim’s algorithm. Firstly, we use polygonal approxi...
136
click to vote
LATIN
1998
Springer
15 years 8 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...