Sciweavers

AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
13 years 5 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
AAECC
2007
Springer
127views Algorithms» more  AAECC 2007»
13 years 5 months ago
Skew-cyclic codes
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the o...
Delphine Boucher, Willi Geiselmann, Felix Ulmer
AAECC
2007
Springer
88views Algorithms» more  AAECC 2007»
13 years 5 months ago
2LEV-D2P4: a package of high-performance preconditioners for scientific and engineering applications
Alfredo Buttari, Pasqua D'Ambra, Daniela di Serafi...
AAECC
2007
Springer
87views Algorithms» more  AAECC 2007»
13 years 5 months ago
Towards an accurate performance modeling of parallel sparse factorization
We present a simulation-based performance model to analyze a parallel sparse LU factorization algorithm on modern cached-based, high-end parallel architectures. We consider supern...
Laura Grigori, Xiaoye S. Li
AAECC
2007
Springer
111views Algorithms» more  AAECC 2007»
13 years 5 months ago
When cache blocking of sparse matrix vector multiply works and why
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
Rajesh Nishtala, Richard W. Vuduc, James Demmel, K...
AAECC
2007
Springer
98views Algorithms» more  AAECC 2007»
13 years 5 months ago
Parametrizing compactly supported orthonormal wavelets by discrete moments
We discuss parametrizations of filter coefficients of scaling functions and compactly supported orthonormal wavelets with several vanishing moments. We introduce the first discr...
Georg Regensburger
AAECC
2007
Springer
88views Algorithms» more  AAECC 2007»
13 years 5 months ago
Hyperelliptic curves with reduced automorphism group A5
We study genus g hyperelliptic curves with reduced automorphism group A5 and give equations y2 = f(x) for such curves in both cases where f(x) is a decomposable polynomial in x2 or...
David Sevilla, Tanush Shaska
AAECC
2007
Springer
117views Algorithms» more  AAECC 2007»
13 years 5 months ago
A predictor-corrector-type technique for the approximate parameterization of intersection curves
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
Bert Jüttler, Pavel Chalmovianský
AAECC
2007
Springer
74views Algorithms» more  AAECC 2007»
13 years 5 months ago
Parametrization of algebraic curves defined by sparse equations
Tobias Beck, Josef Schicho
AAECC
2007
Springer
132views Algorithms» more  AAECC 2007»
13 years 5 months ago
Approximate implicitization of planar curves by piecewise rational approximation of the distance function
We present an approximate implicitization method for planar curves. The computed implicit representation is a piecewise rational approximation of the distance function to the given...
Mohamed Shalaby, Bert Jüttler, Josef Schicho