-
1Report
المؤلفون: van der Hoeven, Joris, Lecerf, Grégoire
المساهمون: Centre National de la Recherche Scientifique (CNRS), Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX), École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS), ANR-22-CE48-0016,NODE,Résolution numérique-symbolique d'équations différentielles(2022), European Project: 101142171,ODELIX
المصدر: https://hal.science/hal-04774026 ; 2024.
مصطلحات موضوعية: polynomial, multi-point evaluation, algorithm, complexity, polynomial multi-point evaluation algorithm complexity, [INFO]Computer Science [cs]
Relation: info:eu-repo/grantAgreement//101142171/EU/Solving differential equations fast, precisely, and reliably/ODELIX
-
2Report
المؤلفون: Neiger, Vincent, Rosenkilde, Johan, Solomatov, Grigory
المساهمون: Mathématiques & Sécurité de l'information (XLIM-MATHIS), XLIM (XLIM), Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS)-Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS), Department of Applied Mathematics and Computer Science Lyngby (DTU Compute), Danmarks Tekniske Universitet = Technical University of Denmark (DTU)
المصدر: https://unilim.hal.science/hal-02521821 ; 2020.
مصطلحات موضوعية: interpolation, Multi-point evaluation, modular composition, bivariate polynomials, precomputation, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]
-
3Conference
المؤلفون: Liu, Yanjun, Qian, Xinyuan, Li, Hongwei, Hao, Meng, Guo, Song
مصطلحات موضوعية: Federated learning, Polynomial multi-point evaluation, Privacy protection, Secure aggregation
Relation: https://repository.hkust.edu.hk/ir/Record/1783.1-129418; IEEE Global Communications Conference, GLOBECOM-Proceedings, v. 2022, December 2022, article number 10001327, p. 3017-3022; https://doi.org/10.1109/GLOBECOM48099.2022.10001327; http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=&rft.volume=&rft.issue=&rft.date=2022&rft.spage=3017&rft.aulast=Liu&rft.aufirst=Yanjun&rft.atitle=Fast+Secure+Aggregation+for+Privacy-Preserving+Federated+Learning&rft.title=2022+IEEE+Global+Communications+Conference,+GLOBECOM+2022+-+Proceedings; http://www.scopus.com/record/display.url?eid=2-s2.0-85146964089&origin=inward; http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000922633503009
الاتاحة: https://repository.hkust.edu.hk/ir/Record/1783.1-129418
https://doi.org/10.1109/GLOBECOM48099.2022.10001327
http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=&rft.volume=&rft.issue=&rft.date=2022&rft.spage=3017&rft.aulast=Liu&rft.aufirst=Yanjun&rft.atitle=Fast+Secure+Aggregation+for+Privacy-Preserving+Federated+Learning&rft.title=2022+IEEE+Global+Communications+Conference,+GLOBECOM+2022+-+Proceedings
http://www.scopus.com/record/display.url?eid=2-s2.0-85146964089&origin=inward
http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000922633503009 -
4Conference
المؤلفون: Moroz, Guillaume, Aronov, Boris
المساهمون: Effective Geometric Algorithms for Surfaces and Visibility (VEGAS), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS), Polytechnic institute of New York University (NYU-Poly), New York University New York (NYU), NYU System (NYU)-NYU System (NYU)
المصدر: SODA - Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms - 2012 ; https://inria.hal.science/inria-00608255 ; SODA - Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms - 2012, Jan 2012, Kyoto, Japan
مصطلحات موضوعية: piecewise-linear functions, integration, $L^2$-norm, multi-point evaluation, algebraic methods, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
Time: Kyoto, Japan
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1107.2312; inria-00608255; https://inria.hal.science/inria-00608255; https://inria.hal.science/inria-00608255v2/document; https://inria.hal.science/inria-00608255v2/file/integral.pdf; ARXIV: 1107.2312
-
5Academic Journal
المؤلفون: Umr Cnrs, Éric Schost
المساهمون: The Pennsylvania State University CiteSeerX Archives
مصطلحات موضوعية: multi-point evaluation, multi-point interpolation, algorithm, complexity, power
وصف الملف: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.393.3271; http://hal.inria.fr/docs/00/66/54/61/PDF/mmeval12.pdf
-
6Academic Journal
المؤلفون: Joris van der Hoeven, Éric Schost
المساهمون: The Pennsylvania State University CiteSeerX Archives
مصطلحات موضوعية: multi-point evaluation, multi-point interpolation, algorithm, complexity, power series multiplication
وصف الملف: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.3118; http://www.csd.uwo.ca/~eschost/publications/mmeval12.pdf
-
7Academic Journal
المؤلفون: Joris van der Hoeven, Éric Schost
المساهمون: The Pennsylvania State University CiteSeerX Archives
مصطلحات موضوعية: multi-point evaluation, multi-point interpolation, algorithm, complexity, power
وصف الملف: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.173.1145; http://www.csd.uwo.ca/%7Eeschost/publications/mmeval.pdf
-
8Academic Journal
المؤلفون: Joris Van Der Hoeven
المساهمون: The Pennsylvania State University CiteSeerX Archives
مصطلحات موضوعية: power series, composition, FFT, multi-point evaluation, algorithm
وصف الملف: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.583.9479; http://www.texmacs.org/joris/fastcomp/fastcomp.pdf
-
9
المؤلفون: Grigory Solomatov, Vincent Neiger, Johan Rosenkilde
المساهمون: Mathématiques & Sécurité de l'information (XLIM-MATHIS), XLIM (XLIM), Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS)-Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS), Department of Applied Mathematics and Computer Science [Lyngby] (DTU Compute), Technical University of Denmark [Lyngby] (DTU)
المصدر: ISSAC
مصطلحات موضوعية: Discrete mathematics, Computer Science - Symbolic Computation, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], FOS: Computer and information sciences, Polynomial, 010102 general mathematics, Field (mathematics), 0102 computer and information sciences, Bivariate analysis, Symbolic Computation (cs.SC), 01 natural sciences, interpolation, Set (abstract data type), modular composition, 010201 computation theory & mathematics, Multi-point evaluation, Precomputation, Point (geometry), 0101 mathematics, precomputation, bivariate polynomials, Modular composition, Mathematics, Interpolation
-
10Report
المؤلفون: van der Hoeven, Joris, Schost, Eric
المساهمون: Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Department of Computer Science, University of Western Ontario (UWO), ANR-09-JCJC-0098,MaGiX,Mathématiques, Analyse, Géométrie, Interfaces, eXactes(2009)
المصدر: https://hal.science/hal-00477659 ; 2010.
مصطلحات موضوعية: multi-point evaluation, multi-point interpolation, algorithm, com- plexity, power series multiplication, MSC 12Y05, 68W30, 68W40, 13P10, 65F99, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
Relation: hal-00477659; https://hal.science/hal-00477659; https://hal.science/hal-00477659v2/document; https://hal.science/hal-00477659v2/file/mmeval12.pdf
-
11
المؤلفون: AronovBoris, MorozGuillaume
المساهمون: Effective Geometric Algorithms for Surfaces and Visibility (VEGAS), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Algorithms, Computation, Image and Geometry (LORIA - ALGO), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Polytechnic institute of New York University (NYU-Poly), New York University [New York] (NYU), NYU System (NYU)-NYU System (NYU), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)
المصدر: Scopus-Elsevier
ACM Transactions on Algorithms
ACM Transactions on Algorithms, 2016, 12 (1), pp.3:1-3:13. ⟨10.1145/2847257⟩
SODA-Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms-2012
SODA-Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms-2012, Jan 2012, Kyoto, Japan
ACM Transactions on Algorithms, Association for Computing Machinery, 2016, 12 (1), pp.3:1-3:13. ⟨10.1145/2847257⟩مصطلحات موضوعية: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Symbolic Computation, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Pure mathematics, multipoint evaluation, ACM: I.: Computing Methodologies/I.1: SYMBOLIC AND ALGEBRAIC MANIPULATION/I.1.2: Algorithms/I.1.2.0: Algebraic algorithms, integration, 0102 computer and information sciences, Bivariate analysis, Symbolic Computation (cs.SC), [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], 01 natural sciences, Domain (mathematical analysis), Piecewise linear function, algebraic methods, Mathematics (miscellaneous), Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0101 mathematics, piecewise-linear functions, polyhedral terrain, Mathematics, piecewise-linearfunction, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], 010102 general mathematics, $L^2$-norm, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.2: Geometrical problems and computations, 010201 computation theory & mathematics, Polyhedral terrain, Computer Science - Computational Geometry, multi-point evaluation