447 search results - page 63 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
174
click to vote
ICCS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
195
click to vote
EVOW
2010
Springer
15 years 4 months ago
2010
Springer
Background: Identifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene reg...
160
click to vote
CGF
2008
15 years 6 months ago
2008
We present a robust and efficient algorithm for the pairwise non-rigid registration of partially overlapping 3D surfaces. Our approach treats non-rigid registration as an optimiza...
179
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
215
click to vote
STOC
2012
ACM
13 years 8 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...