39 search results - page 1 / 8 » Average Bit-Complexity of Euclidean Algorithms |
ICALP
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
CVPR
2012
IEEE
11 years 8 months ago
2012
IEEE
We introduce a framework for defining a distance on the (non-Euclidean) space of Linear Dynamical Systems (LDSs). The proposed distance is induced by the action of the group of o...
APPROX
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
ANTS
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. We provide here a complete average
ALGORITHMICA
1998
13 years 5 months ago
1998
We provide here a complete average-case analysis of the binary continued fraction representation of a random rational whose numerator and denominator are odd and less than N. We an...