6045 search results - page 332 / 1209 » Computable Linearizations of Well-partial-orderings |
173
Voted
ISSAC
2005
Springer
16 years 29 days ago
2005
Springer
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
184
click to vote
ECCV
2004
Springer
16 years 26 days ago
2004
Springer
Abstract. We propose a new scheme for novelty detection in image sequences capable of handling non-stationary background scenarious, such as waving trees, rain and snow. Novelty de...
193
click to vote
ISSAC
2004
Springer
16 years 25 days ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
198
click to vote
NAA
2004
Springer
16 years 25 days ago
2004
Springer
It was recently shown that block-circulant preconditioners applied to a conjugate gradient method used to solve structured sparse linear systems arising from 2D or 3D elliptic prob...
197
Voted
PARA
2004
Springer
16 years 25 days ago
2004
Springer
In this paper we explore the parallelization of the scientific library from GNU both on shared-memory and distributed-memory architectures. A pair of classical operations, arising...