7150 search results - page 176 / 1430 » An Approximation Algorithm for Approximation Rank |
137
Voted
CVPR
1999
IEEE
16 years 8 months ago
1999
IEEE
Tomasi and Kanade [1] introduced the factorization method for recovering 3D structure from 2D video. In their formulation, the 3D shape and 3D motion are computed by using an SVD ...
183
click to vote
PARA
2004
Springer
15 years 11 months ago
2004
Springer
Large and sparse rational eigenproblems where the rational term is of low rank k arise in vibrations of fluid–solid structures and of plates with elastically attached loads. Exp...
162
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...
181
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
166
click to vote
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...