1389 search results - page 44 / 278 » Improved Approximation Algorithms for Label Cover Problems |
129
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
129
click to vote
BMCBI
2010
15 years 2 months ago
2010
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
106
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE and d-RPACK) studied in the literature. Our algorithms are highly eff...
149
Voted
ECIR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...
113
Voted
WEA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...