Výsledky vyhľadávania - acm: g.: mathematics of computing/g.4: (mathematical OR matematika) software*

Algorithm 932: PANG: Software for nonmatching grid projections in 2D and 3D with linear complexity

Autori: Gander, Martin, J. Japhet, Caroline Section de mathématiques Genève a ďalší

Prispievatelia: Gander, Martin, J. Japhet, Caroline Section de mathématiques Genève a ďalší

Zdroj: ACM Transactions on Mathematical Software (TOMS)
ACM Trans. Math. Soft.
ACM Transactions on Mathematical Software

Predmety: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-NA] Mathematics [math]/Numerical Analysis [math.NA], non-matching grid projections, 01 natural sciences, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.3: Efficiency, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.8: Partial Differential Equations/G.1.8.0: Domain decomposition methods, 0101 mathematics, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysis, linear complexity, Advancing front algorithm, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]

Popis súboru: application/pdf

Prístupová URL adresa: https://inria.hal.science/hal-00933643v1
https://doi.org/10.1145/2513109.2513115
https://hal.inria.fr/hal-00933643
https://doi.acm.org/10.1145/2513109.2513115
https://dl.acm.org/doi/10.1145/2513109.2513115
https://doi.org/10.1145/2513109.2513115
https://dblp.uni-trier.de/db/journals/toms/toms40.html#GanderJ13
https://archive-ouverte.unige.ch/unige:171212
https://doi.org/10.1145/2513109.2513115
https://www.unige.ch/~gander/preprints.php
http://www.unige.ch/~gander/preprints.php

Packaging Mathematical Structures

Autori: Garillot, François Gonthier, Georges Mahboubi, Assia a ďalší

Prispievatelia: Garillot, François Gonthier, Georges Mahboubi, Assia a ďalší

Zdroj: Theorem Proving in Higher Order Logics ; https://inria.hal.science/inria-00368403 ; Theorem Proving in Higher Order Logics, 2009, Munich, Germany

Predmety: Formalization of Algebra, Coercive subtyping, Type inference, Coq, SSReflect, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE, ACM: I.: Computing Methodologies/I.1: SYMBOLIC AND ALGEBRAIC MANIPULATION/I.1.0: General, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM]

Geografické téma: Munich, Germany

Dostupnosť: https://inria.hal.science/inria-00368403
https://inria.hal.science/inria-00368403v2/document
https://inria.hal.science/inria-00368403v2/file/main.pdf

Formally Reasoning on a Reconfigurable Component-Based System --- A Case Study for the Industrial World

Autori: Gaspar, Nuno Henrio, Ludovic Madelaine, Eric a ďalší

Prispievatelia: Gaspar, Nuno Henrio, Ludovic Madelaine, Eric a ďalší

Zdroj: The 10th International Symposium on Formal Aspects of Component Software ; https://inria.hal.science/hal-00916115 ; The 10th International Symposium on Formal Aspects of Component Software, Oct 2013, Nanchang, China

Predmety: ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.1: Requirements/Specifications, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.11: Software Architectures, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.8: Verification, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL]

Geografické téma: Nanchang, China

Dostupnosť: https://inria.hal.science/hal-00916115
https://inria.hal.science/hal-00916115v1/document
https://inria.hal.science/hal-00916115v1/file/facs2013.pdf

Designing Efficient Spaced Seeds for SOLiD Read Mapping

Autori: Noé, Laurent Gîrdea, Marta Kucherov, Gregory a ďalší

Prispievatelia: Noé, Laurent Gîrdea, Marta Kucherov, Gregory a ďalší

Zdroj: Adv Bioinformatics

Predmety: Spaced seeds, 0301 basic medicine, [SDV.BIBS] Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], Applied Biosystems SOLiD, read mapping, 0206 medical engineering, ACM: E.: Data/E.2: DATA STORAGE REPRESENTATIONS/E.2.2: Hash-table representations, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.4: Parallel and vector implementations, 02 engineering and technology, [SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.3: Applications, 03 medical and health sciences, seed design, color space alignment, ACM: J.: Computer Applications/J.3: LIFE AND MEDICAL SCIENCES/J.3.0: Biology and genetics, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM], Research Article

Prístupová URL adresa: http://downloads.hindawi.com/journals/abi/2010/708501.pdf
https://pubmed.ncbi.nlm.nih.gov/20936175
https://www.ncbi.nlm.nih.gov/pubmed/20936175
http://europepmc.org/articles/PMC2945724
https://www.hindawi.com/journals/abi/2010/708501/
https://www.archives-ouvertes.fr/inria-00527029v1
https://pubmed.ncbi.nlm.nih.gov/20936175/
http://downloads.hindawi.com/archive/2010/708501.pdf

Certification of a Numerical Result: Use of Interval Arithmetic and Multiple Precision

Autori: Nguyen, Hong Diep Revol, Nathalie Computer arithmetic (ARENAIRE) a ďalší

Prispievatelia: Nguyen, Hong Diep Revol, Nathalie Computer arithmetic (ARENAIRE) a ďalší

Zdroj: NSV-3: Third International Workshop on Numerical Software Verification. ; https://inria.hal.science/inria-00544798 ; NSV-3: Third International Workshop on Numerical Software Verification., Fainekos, Georgios and Goubault, Eric and Putot, Sylvie, Jul 2010, Edinburgh, United Kingdom

Predmety: iterative refinement, interval arithmetic, multiple precision, error bound, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.8: Validation, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.6: Reliability and robustness, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.3: Numerical Linear Algebra, [INFO.INFO-AO]Computer Science [cs]/Computer Arithmetic

Geografické téma: Edinburgh, United Kingdom

Dostupnosť: https://inria.hal.science/inria-00544798
https://inria.hal.science/inria-00544798v1/document
https://inria.hal.science/inria-00544798v1/file/Nguyen-Revol-v2.pdf

Computing modular polynomials in quasi-linear time

Autori: Enge, Andreas Lithe and fast algorithmic number theory (LFANT) Institut de Mathématiques de Bordeaux (IMB) a ďalší

Prispievatelia: Enge, Andreas Lithe and fast algorithmic number theory (LFANT) Institut de Mathématiques de Bordeaux (IMB) a ďalší

Zdroj: Mathematics of Computation. 78:1809-1824

Predmety: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], FOS: Computer and information sciences, Mathematics - Number Theory, Computational Complexity (cs.CC), 01 natural sciences, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT], primality testing), Computer Science - Computational Complexity, FOS: Mathematics, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Number Theory (math.NT), 0101 mathematics, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysis, factoring, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems/F.2.1.4: Number-theoretic computations (e.g, [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]

Popis súboru: application/pdf

Prístupová URL adresa: https://www.ams.org/mcom/2009-78-267/S0025-5718-09-02199-1/S0025-5718-09-02199-1.pdf
http://arxiv.org/abs/0704.3177
https://inria.hal.science/inria-00143084v2
https://inria.hal.science/inria-00143084v2/document
https://dblp.uni-trier.de/db/journals/corr/corr0704.html#abs-0704-3177
https://www.ams.org/mcom/2009-78-267/S0025-5718-09-02199-1/S0025-5718-09-02199-1.pdf
https://www.ams.org/mcom/2009-78-267/S0025-5718-09-02199-1/home.html
https://www.jstor.org/stable/40234686
http://ui.adsabs.harvard.edu/abs/2009MaCom..78.1809E/abstract
https://hal.inria.fr/inria-00143084

The complexity of class polynomial computation via floating point approximations

Autori: Enge, Andreas Algorithmic number theory for cryptology (TANC) Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX) a ďalší

Prispievatelia: Enge, Andreas Algorithmic number theory for cryptology (TANC) Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX) a ďalší

Zdroj: Mathematics of Computation. 78:1089-1107

Predmety: [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Computer Science - Symbolic Computation, FOS: Computer and information sciences, Mathematics - Number Theory, [INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC], Numerical Analysis (math.NA), [INFO.INFO-NA]Computer Science [cs]/Numerical Analysis [cs.NA], Symbolic Computation (cs.SC), 01 natural sciences, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT], primality testing), [INFO.INFO-NA] Computer Science [cs]/Numerical Analysis [cs.NA], FOS: Mathematics, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Mathematics - Numerical Analysis, Number Theory (math.NT), 0101 mathematics, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysis, factoring, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems/F.2.1.4: Number-theoretic computations (e.g, [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]

Popis súboru: application/pdf

Prístupová URL adresa: https://www.ams.org/mcom/2009-78-266/S0025-5718-08-02200-X/S0025-5718-08-02200-X.pdf
http://arxiv.org/abs/cs/0601104
https://inria.hal.science/inria-00001040v3
https://inria.hal.science/inria-00001040v3/document
https://www.ams.org/mcom/2009-78-266/S0025-5718-08-02200-X/home.html
https://www.ams.org/mcom/2009-78-266/S0025-5718-08-02200-X/S0025-5718-08-02200-X.pdf
https://www.jstor.org/stable/pdfplus/40234642.pdf
https://hal.inria.fr/inria-00001040
https://dblp.uni-trier.de/db/journals/corr/corr0601.html#abs-cs-0601104
https://hal.archives-ouvertes.fr/inria-00001040

Formal study of plane Delaunay triangulation

Autori: Dufourd, Jean-François Bertot, Yves Laboratoire des Sciences de l'Image, de l'Informatique et de la Télédétection (LSIIT) a ďalší

Prispievatelia: Dufourd, Jean-François Bertot, Yves Laboratoire des Sciences de l'Image, de l'Informatique et de la Télédétection (LSIIT) a ďalší

Zdroj: Interactive Theorem Proving (ITP-10) ; Interactive Theorem Proving ; https://inria.hal.science/inria-00504027 ; Interactive Theorem Proving, Jul 2010, Edinburgh, United Kingdom. pp.211-226 ; http://www.springerlink.com/content/yk74674271411315/fulltext.pdf

Predmety: Algorithmic Geometry, Formal proof, Triangulation, Delaunay, Flip, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.8: Verification, ACM: G.: Mathematics of Computing/G.0: GENERAL, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Geografické téma: Edinburgh, United Kingdom

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1007.3350; ARXIV: 1007.3350

Dostupnosť: https://inria.hal.science/inria-00504027
https://inria.hal.science/inria-00504027v1/document
https://inria.hal.science/inria-00504027v1/file/Del-ITP10.pdf

Différentiabilité et intégrabilité en Coq. Application à la formule de d'Alembert

Autori: Lelay, Catherine Melquiond, Guillaume Proof of Programs (PROVAL) a ďalší

Prispievatelia: Lelay, Catherine Melquiond, Guillaume Proof of Programs (PROVAL) a ďalší

Zdroj: JFLA - Journées Francophone des Langages Applicatifs - 2012 ; https://inria.hal.science/hal-00642206 ; JFLA - Journées Francophone des Langages Applicatifs - 2012, Feb 2012, Carnac, France

Predmety: ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.8: Verification, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.8: Partial Differential Equations, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Geografické téma: Carnac, France

Dostupnosť: https://inria.hal.science/hal-00642206
https://inria.hal.science/hal-00642206v2/document
https://inria.hal.science/hal-00642206v2/file/lelay.pdf

Conversion by Evaluation

Autori: Boespflug, Mathieu Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX) École polytechnique (X) a ďalší

Prispievatelia: Boespflug, Mathieu Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX) École polytechnique (X) a ďalší

Zdroj: Twelfth International Symposium on Practical Aspects of Declarative Languages ; https://inria.hal.science/inria-00434282 ; Twelfth International Symposium on Practical Aspects of Declarative Languages, Jan 2010, Madrid, Spain

Predmety: ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.3: Efficiency, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs/F.3.1.3: Mechanical verification, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-MS]Computer Science [cs]/Mathematical Software [cs.MS], [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Geografické téma: Spain

Time: Madrid, Spain

Dostupnosť: https://inria.hal.science/inria-00434282
https://inria.hal.science/inria-00434282v1/document
https://inria.hal.science/inria-00434282v1/file/derivesn.pdf

Fast algorithms for computing isogenies between elliptic curves

Autori: Bostan, Alin Salvy, Bruno Morain, Francois a ďalší

Prispievatelia: Bostan, Alin Salvy, Bruno Morain, Francois a ďalší

Zdroj: Mathematics of Computation. 77:1755-1778

Predmety: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Computer Science - Symbolic Computation, FOS: Computer and information sciences, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Computational Complexity (cs.CC), Symbolic Computation (cs.SC), 01 natural sciences, Schoof-Elkies-Atkin algorithm, Fast algorithms, elliptic curves, Newton iteration, FOS: Mathematics, Number Theory (math.NT), 0101 mathematics, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], Mathematics - Number Theory, [INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC], isogenies, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT], Computer Science - Computational Complexity, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], finite fields, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysis, [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]

Popis súboru: application/pdf

Prístupová URL adresa: https://www.ams.org/mcom/2008-77-263/S0025-5718-08-02066-8/S0025-5718-08-02066-8.pdf
http://arxiv.org/abs/cs/0609020
https://inria.hal.science/inria-00091441v1/document
https://inria.hal.science/inria-00091441v1
https://hal.archives-ouvertes.fr/inria-00091441
https://hal.inria.fr/inria-00091441/document
https://arxiv.org/pdf/cs/0609020
http://ui.adsabs.harvard.edu/abs/2008MaCom..77.1755B/abstract
https://specfun.inria.fr/bostan/publications/BoMoSaSc08.pdf
https://dblp.uni-trier.de/db/journals/corr/corr0609.html#abs-cs-0609020
https://arxiv.org/abs/cs/0609020
https://arxiv.org/pdf/cs/0609020v1

Les Interactions sur Tablettes Multi-touch améliorent-elles l'Apprentissage de la Géométrie dans l'Espace ?

Autori: Bertolo, David Laboratoire de Conception, Optimisation et Modélisation des Systèmes (LCOMS) Université de Lorraine (UL) a ďalší

Prispievatelia: Bertolo, David Laboratoire de Conception, Optimisation et Modélisation des Systèmes (LCOMS) Université de Lorraine (UL) a ďalší

Zdroj: 25ème conférence francophone sur l'Interaction Homme-Machine, IHM'13
https://inria.hal.science/hal-00879637
25ème conférence francophone sur l'Interaction Homme-Machine, IHM'13, Nov 2013, Bordeaux, France

Predmety: 3D user interface, Interactions, multi-touch, 3DOF, rotations, child-computer interaction, ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g., HCI)/H.5.2: User Interfaces/H.5.2.7: Interaction styles (e.g., commands, menus, forms, direct manipulation), ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.7: User interfaces, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC]

Geografické téma: Bordeaux, France

Dostupnosť: https://inria.hal.science/hal-00879637
https://inria.hal.science/hal-00879637v1/document
https://inria.hal.science/hal-00879637v1/file/BERTOLO_RD_IHM2013.pdf

Analysis of Large-scale Traffic Dynamics using Non-negative Tensor Factorization

Autori: Han, Yufei Moutarde, Fabien Informatique, Mathématiques et Automatique pour la Route Automatisée (IMARA) a ďalší

Prispievatelia: Han, Yufei Moutarde, Fabien Informatique, Mathématiques et Automatique pour la Route Automatisée (IMARA) a ďalší

Zdroj: ITS World Congress 2012 ; https://inria.hal.science/hal-00766702 ; ITS World Congress 2012, Oct 2012, Vienna, Austria

Predmety: Matrix/Tensor Decomposition, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysis, ACM: H.: Information Systems/H.4: INFORMATION SYSTEMS APPLICATIONS/H.4.2: Types of Systems/H.4.2.0: Decision support (e.g., MIS), [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Geografické téma: Vienna, Austria

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1212.4675; ARXIV: 1212.4675

Dostupnosť: https://inria.hal.science/hal-00766702
https://inria.hal.science/hal-00766702v1/document
https://inria.hal.science/hal-00766702v1/file/PaperTemplateITSWS.pdf

An $L (1/3 + \varepsilon)$ Algorithm for the Discrete Logarithm Problem for Low Degree Curves

Autori: Enge, Andreas Gaudry, Pierrick Algorithmic number theory for cryptology (TANC) a ďalší

Prispievatelia: Enge, Andreas Gaudry, Pierrick Algorithmic number theory for cryptology (TANC) a ďalší

Zdroj: Eurocrypt 2007 ; https://inria.hal.science/inria-00135324 ; Eurocrypt 2007, May 2007, Barcelona, Spain. pp.379-393

Predmety: ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysis, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems/F.2.1.4: Number-theoretic computations (e.g., factoring, primality testing), [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]

Geografické téma: Spain

Time: Barcelona, Spain

Relation: info:eu-repo/semantics/altIdentifier/arxiv/cs.CR/0703032; ARXIV: cs.CR/0703032

Dostupnosť: https://inria.hal.science/inria-00135324
https://inria.hal.science/inria-00135324v1/document
https://inria.hal.science/inria-00135324v1/file/l13.pdf

Activity Recognition and Uncertain Knowledge in Video Scenes

Autori: Romdhane, Rim Crispim-Junior, Carlos Fernando Bremond, Francois a ďalší

Prispievatelia: Romdhane, Rim Crispim-Junior, Carlos Fernando Bremond, Francois a ďalší

Zdroj: IEEE International Conference on Advanced Video and Signal-Based Surveillance (AVSS) ; https://inria.hal.science/hal-01059602 ; IEEE International Conference on Advanced Video and Signal-Based Surveillance (AVSS), Aug 2013, Krakow, Poland

Predmety: ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysis, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]

Geografické téma: Krakow, Poland

Dostupnosť: https://inria.hal.science/hal-01059602
https://inria.hal.science/hal-01059602v1/document
https://inria.hal.science/hal-01059602v1/file/rimAVSS2013.pdf

Numerical reproducibility in HPC: issues in interval arithmetic

Autori: Revol, Nathalie Théveny, Philippe Arithmetic and Computing (ARIC) a ďalší

Prispievatelia: Revol, Nathalie Théveny, Philippe Arithmetic and Computing (ARIC) a ďalší

Zdroj: SWIM'2013: Small Workshop on Interval Methods ; https://inria.hal.science/hal-00922114 ; SWIM'2013: Small Workshop on Interval Methods, Jun 2013, Brest, France

Predmety: numerical reproducibility, floating-point computation, interval computation, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE, [INFO.INFO-AO]Computer Science [cs]/Computer Arithmetic

Geografické téma: Brest, France

Dostupnosť: https://inria.hal.science/hal-00922114
https://inria.hal.science/hal-00922114v1/document
https://inria.hal.science/hal-00922114v1/file/Revol-Theveny-SWIM13.pdf

From Self-Interpreters to Normalization by Evaluation

Autori: Boespflug, Mathieu Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX) École polytechnique (X) a ďalší

Prispievatelia: Boespflug, Mathieu Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX) École polytechnique (X) a ďalší

Zdroj: 2009 Workshop on Normalization by Evaluation
https://inria.hal.science/inria-00434284
2009 Workshop on Normalization by Evaluation, Olivier Danvy, Aug 2009, Los Angeles, United States
http://www.brics.dk/~danvy/NBE09/informal-proceedings/

Predmety: ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.3: Efficiency, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Geografické téma: Los Angeles, United States

Relation: info:eu-repo/semantics/altIdentifier/arxiv/0911.4203; ARXIV: 0911.4203

Dostupnosť: https://inria.hal.science/inria-00434284
https://inria.hal.science/inria-00434284v1/document
https://inria.hal.science/inria-00434284v1/file/selfnbe.pdf

Efficient normalization by evaluation

Autori: Boespflug, Mathieu Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX) École polytechnique (X) a ďalší

Prispievatelia: Boespflug, Mathieu Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX) École polytechnique (X) a ďalší

Zdroj: 2009 Workshop on Normalization by Evaluation
https://inria.hal.science/inria-00434283
2009 Workshop on Normalization by Evaluation, Olivier Danvy, Aug 2009, Los Angeles, United States
http://www.brics.dk/~danvy/NBE09/informal-proceedings/

Predmety: ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.3: Efficiency, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF]

Geografické téma: Los Angeles, United States

Dostupnosť: https://inria.hal.science/inria-00434283
https://inria.hal.science/inria-00434283v1/document
https://inria.hal.science/inria-00434283v1/file/NBE09-Boespflug-fastnbe.pdf

Generating Shorter Bases for Hard Random Lattices

Autori: Alwen, Joël Peikert, Chris New York University a ďalší

Prispievatelia: Alwen, Joël Peikert, Chris New York University a ďalší

Zdroj: 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009
https://hal.inria.fr/inria-00359718
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.75-86

Predmety: lattices, random, short basis, average-case hardness, Hermite normal form, cryptography, ACM: E.: Data/E.3: DATA ENCRYPTION/E.3.2: Public key cryptosystems, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysis, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]

Geografické téma: Freiburg, Germany

Relation: inria-00359718; https://hal.inria.fr/inria-00359718; https://hal.inria.fr/inria-00359718/document; https://hal.inria.fr/inria-00359718/file/06-alwen.pdf

Dostupnosť: https://hal.inria.fr/inria-00359718
https://hal.inria.fr/inria-00359718/document
https://hal.inria.fr/inria-00359718/file/06-alwen.pdf

The Computational Geometry Algorithms Library CGAL

Autori: Fogel, Efi Teillaud, Monique School of Computer Science (TAU-CS) a ďalší

Prispievatelia: Fogel, Efi Teillaud, Monique School of Computer Science (TAU-CS) a ďalší

Zdroj: ISSN: 1932-2240 ; ACM Communications in Computer Algebra ; https://hal.inria.fr/hal-00867884 ; ACM Communications in Computer Algebra, Association for Computing Machinery (ACM), 2013, Issue 185, 47 (3), pp.85-87.

Predmety: ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.13: Reusable Software/D.2.13.1: Reusable libraries, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]

Relation: hal-00867884; https://hal.inria.fr/hal-00867884; https://hal.inria.fr/hal-00867884/document; https://hal.inria.fr/hal-00867884/file/SIGSAM-CCA_2013.pdf

Dostupnosť: https://hal.inria.fr/hal-00867884
https://hal.inria.fr/hal-00867884/document
https://hal.inria.fr/hal-00867884/file/SIGSAM-CCA_2013.pdf