1410 search results - page 207 / 282 » The Algorithmics of Solitaire-Like Games |
158
Voted
BIBE
2008
IEEE
15 years 10 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
117
Voted
ICPR
2000
IEEE
16 years 4 months ago
2000
IEEE
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
144
Voted
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
138
Voted
STOC
2006
ACM
16 years 4 months ago
2006
ACM
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
143
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...