3875 search results - page 246 / 775 » Approximation algorithms for the 0-extension problem |
153
click to vote
NIPS
2007
15 years 8 months ago
2007
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
168
click to vote
GI
2009
Springer
15 years 4 months ago
2009
Springer
: This paper describes the passive emitter localization using Time Difference of Arrival (TDOA) measurements. It investigates various methods for estimating the solution of this no...
244
click to vote
ARITH
2011
IEEE
14 years 6 months ago
2011
IEEE
—We consider the problem of short division — i.e., approximate quotient — of multiple-precision integers. We present ready-to-implement algorithms that yield an approximation...
157
click to vote
SPIRE
2005
Springer
16 years 5 days ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
155
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...