Sciweavers

51 search results - page 5 / 11
» The Equational Theory of Fixed Points with Applications to G...
Sort
View
DLT
2003
13 years 8 months ago
Boolean Grammars
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
Alexander Okhotin
CSDA
2006
109views more  CSDA 2006»
13 years 7 months ago
Possibility theory and statistical reasoning
Numerical possibility distributions can encode special convex families of probability measures. The connection between possibility theory and probability theory is potentially fru...
Didier Dubois
FOCS
2002
IEEE
14 years 11 days 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
CORR
1999
Springer
124views Education» more  CORR 1999»
13 years 7 months ago
An Algebraic Programming Style for Numerical Software and its Optimization
The abstract mathematical theory of partial differential equations (PDEs) is formulated in terms of manifolds,scalar fields, tensors, and the like, but these algebraic structures a...
T. B. Dinesh, Magne Haveraaen, Jan Heering
ISSAC
1994
Springer
102views Mathematics» more  ISSAC 1994»
13 years 11 months ago
An Application of Symbolic Computation in the Physical Sciences
An example of a problem in the physical sciences is discussed where application of various symbolic computation facilities available in many algebraic computing systems leads to a...
Charles C. Dyer