6110 search results - page 77 / 1222 » Approximate Computing |
154
click to vote
MICS
2007
15 years 2 months ago
2007
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given B...
119
click to vote
WADS
2005
Springer
15 years 8 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
133
Voted
PPSN
2010
Springer
15 years 1 months ago
2010
Springer
The hypervolume indicator is widely used to guide the search and to evaluate the performance of evolutionary multi-objective optimization algorithms. It measures the volume of the ...
134
click to vote
RANDOM
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
119
Voted
STOC
2009
ACM
16 years 3 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...