Sciweavers

9 search results - page 1 / 2
» Laurent polynomials and Eulerian numbers
Sort
View
JCT
2011
52views more  JCT 2011»
12 years 12 months ago
Laurent polynomials and Eulerian numbers
Daniel Erman, Gregory G. Smith, Anthony Vár...
TOG
2010
111views more  TOG 2010»
12 years 11 months ago
Detail-preserving fully-Eulerian interface tracking framework
This paper introduces a fully-Eulerian interface tracking framework that preserves the fine details of liquids. Unlike existing Eulerian methods, the proposed framework shows good...
Nambin Heo, Hyeong-Seok Ko
ARITH
2005
IEEE
13 years 10 months ago
Arithmetic Operations in the Polynomial Modular Number System
We propose a new number representation and arithmetic for the elements of the ring of integers modulo p. The socalled Polynomial Modular Number System (PMNS) allows for fast polyn...
Jean-Claude Bajard, Laurent Imbert, Thomas Plantar...
FFA
2008
82views more  FFA 2008»
13 years 5 months ago
Asymptotic behavior of the number of solutions for non-Archimedean Diophantine approximations with restricted denominators
We consider metric results for the asymptotic behavior of the number of solutions of Diophantine approximation inequalities with restricted denominators for Laurent formal power s...
Valérie Berthé, Hitoshi Nakada, Rie ...
CORR
2008
Springer
125views Education» more  CORR 2008»
13 years 5 months ago
Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy