497 search results - page 8 / 100 » On a Parallel Extended Euclidean Algorithm |
COLCOM
2009
IEEE
14 years 13 days ago
2009
IEEE
Abstract—Nodes within existing P2P networks typically exchange periodic keep-alive messages in order to maintain network connections between neighbours. This paper investigates a...
ICDAR
1997
IEEE
13 years 12 months ago
1997
IEEE
An algorithm is presented that allows to perform skeletonization of large maps with much lower memory requirements than with the straightforward approach. The maps are divided int...
ECOOPW
1998
Springer
13 years 12 months ago
1998
Springer
We develop generic parallel algorithms as extensible modules that encapsulate related classes and parallel methods. Extensible modules define common parallel structures, such as m...
ISSAC
2007
Springer
14 years 1 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...
JMLR
2006
2006
Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming
13 years 7 months ago
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and secon...