1120 search results - page 12 / 224 » Parallel Algorithmic Techniques for Combinatorial Computatio... |
142
click to vote
COMPGEOM
1995
ACM
15 years 5 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
105
Voted
FCT
2007
Springer
15 years 8 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
113
Voted
DAGSTUHL
2000
15 years 3 months ago
2000
The emerging discipline of algorithm engineering has primarily focussed on transforming pencil-and-paper sequential algorithms into robust, efficient, well tested, and easily used ...
144
click to vote
PAMI
2010
15 years 8 days ago
2010
—We propose a combinatorial solution to determine the optimal elastic matching of a deformable template to an image. The central idea is to cast the optimal matching of each temp...
120
click to vote
ICCV
2005
IEEE
16 years 3 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...