29 search results - page 1 / 6 » The Complete Analysis of the Binary Euclidean Algorithm |
ANTS
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. We provide here a complete average
ALGORITHMICA
1998
13 years 4 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...
ALGORITHMICA
2010
13 years 5 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
SIAMMAX
2010
12 years 11 months ago
2010
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...