1728 search results - page 98 / 346 » The Accelerated Euclidean Algorithm |
128
Voted
BCS
2008
15 years 4 months ago
2008
Digital circuits with feedback loops can solve some instances of NP-hard problems by relaxation: the circuit will either oscillate or settle down to a stable state that represents...
161
click to vote
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
We present a first sparse modular algorithm for computing a greatest common divisor of two polynomials f1, f2 ∈ L[x] where L is an algebraic function field in k ≥ 0 paramete...
107
click to vote
ESWA
2010
15 years 7 days ago
2010
1 In this study, a novel robust clustering algorithm, robust interval competitive agglomeration (RICA) clustering algorithm, is proposed to overcome the problems of the outliers, t...
135
click to vote
WINET
2010
15 years 1 months ago
2010
In this paper we consider how to collect data from sensors deployed in the Euclidean plane in a timeefficient way. We assume that all sensors could adjust their transmission range...
242
click to vote
WADS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...