Sciweavers

106 search results - page 2 / 22
» A Linear Space Algorithm for Computing the Hermite Normal Fo...
Sort
View
ISSAC
1997
Springer
157views Mathematics» more  ISSAC 1997»
13 years 9 months ago
On the Worst-case Complexity of Integer Gaussian Elimination
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
Xin Gui Fang, George Havas
SAC
2002
ACM
13 years 5 months ago
Automatic code generation for executing tiled nested loops onto parallel architectures
This paper presents a novel approach for the problem of generating tiled code for nested for-loops using a tiling transformation. Tiling or supernode transformation has been widel...
Georgios I. Goumas, Maria Athanasaki, Nectarios Ko...
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
13 years 10 months ago
Generalized normal forms and polynomial system solving
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 ...
Bernard Mourrain
NAACL
2010
13 years 3 months ago
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
Carlos Gómez-Rodríguez, Marco Kuhlma...
ICPR
2010
IEEE
13 years 4 months ago
Robust ECG Biometrics by Fusing Temporal and Cepstral Information
—The use of vital signs as a biometric is a potentially viable approach in a variety of application scenarios such as security and personalized health care. In this paper, a nove...
Ming Li, Shrikanth Narayanan