Filtrer vos résultats
- 40
- 5
- 18
- 16
- 5
- 3
- 1
- 1
- 1
- 3
- 44
- 9
- 1
- 2
- 9
- 1
- 1
- 4
- 3
- 1
- 1
- 1
- 2
- 1
- 3
- 4
- 4
- 2
- 2
- 3
- 1
- 42
- 2
- 1
- 45
- 28
- 11
- 6
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 45
- 25
- 7
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
45 résultats
|
|
triés par
|
|
Integer and Floating-Point Constant Multipliers for FPGAsInternational Conference on Application-Specific Systems, Architectures and Processors, 2008, IMEC, Jul 2008, Leuven, Belgium. pp.239-244, ⟨10.1109/ASAP.2008.4580184⟩
Communication dans un congrès
ensl-00269219v1
|
||
|
A new range-reduction algorithmIEEE Transactions on Computers, 2005, 54 (3), pp.331- 339. ⟨10.1109/TC.2005.36⟩
Article dans une revue
ensl-00086904v1
|
||
An Efficient Method for Evaluating Polynomial and Rational Function ApproximationsASAP 08, Jul 2008, Leuven, Belgium. pp.233 -- 238
Communication dans un congrès
hal-00761652v1
|
|||
|
A path-norm toolkit for modern networks: consequences, promises and challenges2023
Pré-publication, Document de travail
hal-04225201v4
|
||
|
A comparison between hardware accelerators for the modified Tate pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$Second International Conference on Pairing-Based Cryptography – Pairing 2008, Sep 2008, Egham, United Kingdom. pp.297-315, ⟨10.1007/978-3-540-85538-5_20⟩
Communication dans un congrès
inria-00423977v1
|
||
|
(M,p,k)-friendly points: a table-based method for trigonometric function evaluation2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors, Jul 2012, Delft, Netherlands. p. 46-52, ISBN: 978-1-4673-2243-0, ⟨10.1109/ASAP.2012.17⟩
Communication dans un congrès
ensl-00759912v1
|
||
|
Computing machine-efficient polynomial approximationsACM Transactions on Mathematical Software, 2006, 32 (2), pp.236-256. ⟨10.1145/1141885.1141890⟩
Article dans une revue
ensl-00086826v1
|
||
|
Hardware operators for function evaluation using sparse-coefficient polynomialsElectronics Letters, 2006, 42 (25), pp.1441-1442. ⟨10.1049/el:20062373⟩
Article dans une revue
lirmm-00125483v2
|
||
|
Efficient and Validated Numerical Evaluation of Abelian IntegralsACM Transactions on Mathematical Software, In press, ⟨10.1145/3637550⟩
Article dans une revue
hal-03561096v2
|
||
Le dilemme du fabricant de tablesLa Recherche, 2023, 572
Article dans une revue
hal-03932037v1
|
|||
|
Error analysis of some operations involved in the Cooley-Tukey Fast Fourier TransformACM Transactions on Mathematical Software, 2020, 46 (2), pp.1-34. ⟨10.1145/3368619⟩
Article dans une revue
hal-01949458v2
|
||
|
A Lattice Basis Reduction Approach for the Design of Finite Wordlength FIR FiltersIEEE Transactions on Signal Processing, 2018, 66 (10), pp.2673-2684. ⟨10.1109/TSP.2018.2812739⟩
Article dans une revue
hal-01308801v3
|
||
|
Differential-Difference Properties of Hypergeometric SeriesProceedings of the American Mathematical Society, 2023, 151 (6), pp.2603--2617. ⟨10.1090/proc/16316⟩
Article dans une revue
hal-03712632v1
|
||
|
Error in ulps of the multiplication or division by a correctly-rounded function or constant in binary floating-point arithmeticIEEE Transactions on Emerging Topics in Computing, In press, ⟨10.1109/TETC.2023.3294986⟩
Article dans une revue
hal-04044716v2
|
||
A New Lower Bound on the Hilbert Number for Quartic Systems2019
Pré-publication, Document de travail
hal-02085895v1
|
|||
|
Efficient polynomial $L^{\infty}$-approximations18th IEEE Symposium on Computer Arithmetic, Jun 2007, Montpellier, France. pp.169-176, ⟨10.1109/ARITH.2007.17⟩
Communication dans un congrès
inria-00119513v2
|
||
|
Comparison between binary and decimal floating-point numbersIEEE Transactions on Computers, 2016, 65 (7), pp.2032-2044. ⟨10.1109/TC.2015.2479602⟩
Article dans une revue
hal-01021928v2
|
||
|
Finding the «truncated» polynomial that is closest to a function[Research Report] RR-4787, LIP RR-2003-21, INRIA, LIP. 2003
Rapport
inria-00071799v1
|
||
|
On a two-valued sequence and related continued fractions in power series fieldsRamanujan Journal, 2018, 45 (3), pp.859-871. ⟨10.1007/s11139-017-9892-7⟩
Article dans une revue
hal-01348576v3
|
||
|
Towards Machine-Efficient Rational L ∞ -Approximations of Mathematical Functions30th IEEE International Symposium on Computer Arithmetic ARITH 2023, Sep 2023, Portland, United States
Communication dans un congrès
hal-04093020v2
|
||
|
Correct rounding of algebraic functionsRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2007, 41 (1), pp.71-83. ⟨10.1051/ita:2007002⟩
Article dans une revue
ensl-00143230v1
|
||
|
Un peu de théorie des nombres et de calcul formel au service de l'arithmétique des ordinateursArithmétique des ordinateurs. École Normale Supérieure de Lyon, 2017
HDR
tel-01658342v3
|
||
|
Exponential sums and correctly-rounded functionsIEEE Transactions on Computers, 2017, 66 (12), pp.2044-2057. ⟨10.1109/TC.2017.2690850⟩
Article dans une revue
hal-01396027v3
|
||
|
Validated and numerically efficient Chebyshev spectral methods for linear ordinary differential equationsACM Transactions on Mathematical Software, 2018, 44 (4), pp.44:1-44:42. ⟨10.1145/3208103⟩
Article dans une revue
hal-01526272v3
|
||
|
(M, p, k)-Friendly Points: A Table-based Method to Evaluate Trigonometric FunctionIEEE Transactions on Circuits and Systems Part 2 Analog and Digital Signal Processing, 2014, 61 (9), pp.711-715. ⟨10.1109/TCSII.2014.2331094⟩
Article dans une revue
ensl-01001673v1
|
||
|
Algorithms and arithmetic operators for computing the $\eta_T$ pairing in characteristic threeIEEE Transactions on Computers, 2008, Special Section on Special-Purpose Hardware for Cryptography and Cryptanalysis, 57 (11), pp.1454-1468. ⟨10.1109/TC.2008.103⟩
Article dans une revue
inria-00423993v1
|
||
|
Accelerating Correctly Rounded Floating-PointDivision when the Divisor is Known in AdvanceIEEE Transactions on Computers, 2004, 53 (8), pp.1069- 1072. ⟨10.1109/TC.2004.37⟩
Article dans une revue
ensl-00087465v1
|
||
|
Implementing decimal floating-point arithmetic through binary: some suggestions21st IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP 2010), Jul 2010, Rennes, France. pp.317-320, ⟨10.1109/ASAP.2010.5540969⟩
Communication dans un congrès
ensl-00463353v2
|
||
|
Chebyshev Interpolation Polynomial-based Tools for Rigorous ComputingISSAC '10, 2010 International Symposium on Symbolic and Algebraic Computation, 2010, Münich, Germany. pp.147-154, ⟨10.1145/1837934.1837966⟩
Communication dans un congrès
ensl-00472509v2
|
||
|
Floating-Point $L^2$-Approximations18th IEEE Symposium in Computer Arithmetic, Jun 2007, Montpellier, France. pp.177-186, ⟨10.1109/ARITH.2007.38⟩
Communication dans un congrès
inria-00119254v2
|
- 1
- 2