2570 search results - page 34 / 514 » Fast Algorithms For The Computation Of Ranklets |
COMPGEOM
2001
ACM
15 years 1 months ago
2001
ACM
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
GD
1994
Springer
15 years 1 months ago
1994
Springer
d Abstract and System Demonstration) Arne Frick , Andreas Ludwig, Heiko Mehldau Universit
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—Fast multiplication can be achieved by using canonical signed digit (CSD) to speed-up computations. Conversion to CSD is needed when the multiplier is not known a priori...
CAP
2010
14 years 4 months ago
2010
The nth cyclotomic polynomial, n(z), is the monic polynomial whose (n) distinct roots are the nth primitive roots of unity. n(z) can be computed efficiently as a quotient of terms...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...