Sciweavers

709 search results - page 16 / 142
» On LR(k)-Parsers of Polynomial Size
Sort
View
CASES
2004
ACM
15 years 3 months ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
CORR
2006
Springer
88views Education» more  CORR 2006»
14 years 9 months ago
Polynomial Time Nondimensionalisation of Ordinary Differential Equations via their Lie Point Symmetries
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equation. ...
Evelyne Hubert, Alexandre Sedoglavic
COMPUTING
2007
108views more  COMPUTING 2007»
14 years 9 months ago
Accurate evaluation of divided differences for polynomial interpolation of exponential propagators
In this paper, we propose an approach to the computation of more accurate divided differences for the interpolation in the Newton form of the matrix exponential propagator ϕ(hA)v...
Marco Caliari
ISSAC
2004
Springer
159views Mathematics» more  ISSAC 2004»
15 years 3 months ago
Complexity issues in bivariate polynomial factorization
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
Alin Bostan, Grégoire Lecerf, Bruno Salvy, ...
CORR
2006
Springer
91views Education» more  CORR 2006»
14 years 9 months ago
Quasi-friendly sup-interpretations
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
Jean-Yves Marion, Romain Péchoux