Sciweavers

281 search results - page 52 / 57
» Solving Parametric Algebraic Systems
Sort
View
FOCS
2002
IEEE
14 years 3 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
FMLDO
1990
Springer
86views Database» more  FMLDO 1990»
14 years 2 months ago
Views in Object-Oriented Databases
Object-oriented database systems (ooDBMSs) are supposed to offer at least the functionality available in commercial relational DBMSs of today. One important consequence of this is...
Marc H. Scholl, Christian Laasch, Markus Tresch
ICC
2007
IEEE
162views Communications» more  ICC 2007»
14 years 2 months ago
LSP and Back Up Path Setup in MPLS Networks Based on Path Criticality Index
This paper reports on a promising approach for solving problems found when Multi Protocol Label Switching (MPLS), soon to be a dominant protocol, is used in core network systems. D...
Ali Tizghadam, Alberto Leon-Garcia
EUROCRYPT
2006
Springer
14 years 2 months ago
Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
Jean-Charles Faugère, Ludovic Perret
NAA
2000
Springer
125views Mathematics» more  NAA 2000»
14 years 2 months ago
Matrix Computations Using Quasirandom Sequences
Abstract. The convergence of Monte Carlo method for numerical integration can often be improved by replacing pseudorandom numbers (PRNs) with more uniformly distributed numbers kno...
Michael Mascagni, Aneta Karaivanova