7930 search results - page 286 / 1586 » Greedy in Approximation Algorithms |
152
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an ...
176
click to vote
ICCV
2005
IEEE
16 years 8 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 ...
153
click to vote
JSC
2006
15 years 6 months ago
2006
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
195
click to vote
IPL
2000
15 years 6 months ago
2000
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
185
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Much recent work in the theoretical computer science, linear algebra, and machine learning has considered matrix decompositions of the following form: given an m