Sciweavers

AAECC
2010
Springer
136views Algorithms» more  AAECC 2010»
13 years 11 months ago
New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel...
Grégoire Lecerf
AAECC
2008
Springer
83views Algorithms» more  AAECC 2008»
13 years 11 months ago
Fast separable factorization and applications
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
Grégoire Lecerf
AAECC
2010
Springer
114views Algorithms» more  AAECC 2010»
13 years 11 months ago
Termination of narrowing via termination of rewriting
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
Naoki Nishida, Germán Vidal
AAECC
2008
Springer
101views Algorithms» more  AAECC 2008»
13 years 11 months ago
In search of mathematical primitives for deriving universal projective hash families
We provide some guidelines for deriving new projective hash families of cryptographic interest. Our main building blocks are so called group action systems; we explore what propert...
Maria Isabel Gonzalez Vasco, Jorge Luis Villar
AAECC
2008
Springer
85views Algorithms» more  AAECC 2008»
13 years 11 months ago
In memoriam Thomas Beth
Jacques Calmet, Willi Geiselmann
AAECC
2010
Springer
99views Algorithms» more  AAECC 2010»
13 years 11 months ago
Structural theorems for symbolic summation
Abstract. Starting with Karr's structural theorem for summation --the discrete version of Liouville's structural theorem for integration-- we work out crucial properties ...
Carsten Schneider
AAECC
2010
Springer
132views Algorithms» more  AAECC 2010»
13 years 11 months ago
On the geometry of polar varieties
The aim of this paper is a comprehensive presentation of the geometrical tools which are necessary to prove the correctness of several up to date algorithms with intrinsic complex...
Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey ...
AAECC
2008
Springer
110views Algorithms» more  AAECC 2008»
13 years 11 months ago
Adding constants to string rewriting
We consider unary term rewriting, i.e., term rewriting with unary signatures where all function symbols are either unary or constants. Terms over such signatures can be transformed...
René Thiemann, Hans Zantema, Jürgen Gi...
ICIP
2007
IEEE
13 years 11 months ago
Statistical Multiscale Image Segmentation via Alpha-Stable Modeling
This paper presents a new statistical image segmentation algorithm, in which the texture features are modeled by Symmetric Alpha-Stable (SαS) distributions. These features are ef...
Tao Wan, Cedric Nishan Canagarajah, Alin Achim
DCC
2007
IEEE
13 years 11 months ago
Practical Binary Adaptive Block Coder
This paper describes design of a low-complexity algorithm for adaptive encoding/decoding of binary sequences produced by memoryless sources. The algorithm implements universal blo...
Yuriy A. Reznik