Výsledky vyhledávání - "acm: g.: mathematics of computing/g.4: mathematical software/g.4.0: algorithm design AND analysis"

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

Témata: 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

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

View record from BASE

Nájsť tento článok vo Web of Science

5

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

Autoři: Han, Yufei Moutarde, Fabien Informatique, Mathématiques et Automatique pour la Route Automatisée (IMARA) a další

Přispěvatelé: Han, Yufei Moutarde, Fabien Informatique, Mathématiques et Automatique pour la Route Automatisée (IMARA) a další

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

Témata: 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

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

View record from BASE

Nájsť tento článok vo Web of Science

6

Fast algorithms for computing isogenies between elliptic curves

Autoři: Bostan, Alin Salvy, Bruno Morain, Francois a další

Přispěvatelé: Bostan, Alin Salvy, Bruno Morain, Francois a další

Zdroj: Mathematics of Computation. 77:1755-1778

Témata: [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 souboru: application/pdf

Pří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

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

7

Generating Shorter Bases for Hard Random Lattices

Autoři: Alwen, Joël Peikert, Chris New York University a další

Přispěvatelé: Alwen, Joël Peikert, Chris New York University a další

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

Témata: 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

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

View record from BASE

Nájsť tento článok vo Web of Science

8

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

Autoři: Enge, Andreas Gaudry, Pierrick Algorithmic number theory for cryptology (TANC) a další

Přispěvatelé: Enge, Andreas Gaudry, Pierrick Algorithmic number theory for cryptology (TANC) a další

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

Témata: 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

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

View record from BASE

Nájsť tento článok vo Web of Science

9

Reduction of Algebraic Parametric Systems by Rectification of their Affine Expanded Lie Symmetries

Autoři: Sedoglavic, Alexandre Algebra for Digital Identification and Estimation (ALIEN) Inria Lille - Nord Europe a další

Přispěvatelé: Sedoglavic, Alexandre Algebra for Digital Identification and Estimation (ALIEN) Inria Lille - Nord Europe a další

Zdroj: Second International Conference Algebraic Biology 2007 ; Algebraic Biology 2007 ; https://inria.hal.science/inria-00120991 ; Algebraic Biology 2007, Jul 2007, RISC, Castle of Hagenberg, Austria, Austria. pp.277-291, ⟨10.1007/978-3-540-73433-8_20⟩

Témata: Algebraic system simplification, Lie symmetries, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysis, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], [SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]

Geografické téma: RISC, Castle of Hagenberg, Austria

Relation: info:eu-repo/semantics/altIdentifier/arxiv/cs.SC/0612094; ARXIV: cs.SC/0612094

Dostupnost: https://inria.hal.science/inria-00120991
https://inria.hal.science/inria-00120991/document
https://inria.hal.science/inria-00120991/file/Sedoglavic2006.pdf
https://doi.org/10.1007/978-3-540-73433-8_20

View record from BASE

Nájsť tento článok vo Web of Science

10

Division-Free Binary-to-Decimal Conversion

Autoři: Bouvier, Cyril Zimmermann, Paul Cryptology, Arithmetic: Hardware and Software (CARAMEL) a další

Přispěvatelé: Bouvier, Cyril Zimmermann, Paul Cryptology, Arithmetic: Hardware and Software (CARAMEL) a další

Zdroj: ISSN: 0018-9340 ; IEEE Transactions on Computers ; https://inria.hal.science/hal-00864293 ; IEEE Transactions on Computers, 2014, 63 (8), pp.1895-1901. ⟨10.1109/TC.2014.2315621⟩.

Témata: binary-to-decimal conversion, scaled remainder tree, GMP, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysis, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]

Dostupnost: https://inria.hal.science/hal-00864293
https://inria.hal.science/hal-00864293v2/document
https://inria.hal.science/hal-00864293v2/file/get_str.pdf
https://doi.org/10.1109/TC.2014.2315621

View record from BASE

Nájsť tento článok vo Web of Science

11

Column Generation for Extended Formulations

Autoři: Sadykov, Ruslan Vanderbeck, François Reformulations based algorithms for Combinatorial Optimization (Realopt) a další

Přispěvatelé: Sadykov, Ruslan Vanderbeck, François Reformulations based algorithms for Combinatorial Optimization (Realopt) a další

Zdroj: ISSN: 2192-4406.

Témata: ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.0: General, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysis, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]

Relation: hal-00661758; https://hal.inria.fr/hal-00661758; https://hal.inria.fr/hal-00661758v2/document; https://hal.inria.fr/hal-00661758v2/file/cgefHall.pdf

Dostupnost: https://hal.inria.fr/hal-00661758
https://hal.inria.fr/hal-00661758v2/document
https://hal.inria.fr/hal-00661758v2/file/cgefHall.pdf
https://doi.org/10.1007/s13675-013-0009-9

View record from BASE

Nájsť tento článok vo Web of Science

12

An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves

Autoři: Enge, Andreas Gaudry, Pierrick Thomé, Emmanuel a další

Přispěvatelé: Enge, Andreas Gaudry, Pierrick Thomé, Emmanuel a další

Zdroj: ISSN: 0933-2790.

Témata: discrete logarithm, algebraic curve, subexponentiality, function field sieve, 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]

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

Dostupnost: https://inria.hal.science/inria-00383941
https://inria.hal.science/inria-00383941v2/document
https://inria.hal.science/inria-00383941v2/file/L13.pdf
https://doi.org/10.1007/s00145-010-9057-y

View record from BASE

Nájsť tento článok vo Web of Science

13

The complexity of class polynomial computation via floating point approximations

Autoři: Enge, Andreas Algorithmic number theory for cryptology (TANC) Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX) a další

Přispěvatelé: Enge, Andreas Algorithmic number theory for cryptology (TANC) Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX) a další

Zdroj: ISSN: 0025-5718.

Témata: 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-NA]Computer Science [cs]/Numerical Analysis [cs.NA], [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

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

Dostupnost: https://inria.hal.science/inria-00001040
https://inria.hal.science/inria-00001040v3/document
https://inria.hal.science/inria-00001040v3/file/class.pdf

View record from BASE

Nájsť tento článok vo Web of Science

14

Implicit Euler numerical simulations of sliding mode systems

Autoři: Acary, Vincent Brogliato, Bernard Modelling, Simulation, Control and Optimization of Non-Smooth Dynamical Systems (BIPOP) a další

Přispěvatelé: Acary, Vincent Brogliato, Bernard Modelling, Simulation, Control and Optimization of Non-Smooth Dynamical Systems (BIPOP) a další

Zdroj: https://inria.hal.science/inria-00374840 ; [Research Report] RR-6886, INRIA. 2009, pp.39.

Témata: Switching systems, Filippov's differential inclusions, complementarity problems, backward Euler algorithm, sliding modes, maximal monotone mappings, mixed linear complementarity problem, ZOH discretization, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.7: Ordinary Differential Equations/G.1.7.8: One-step (single step) methods, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.7: Ordinary Differential Equations/G.1.7.3: Differential-algebraic equations, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysis, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA], [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering

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

Dostupnost: https://inria.hal.science/inria-00374840
https://inria.hal.science/inria-00374840v2/document
https://inria.hal.science/inria-00374840v2/file/RR-6886.pdf

View record from BASE

Nájsť tento článok vo Web of Science

15

Notes sur la régularité Lipschitzienne

Autoři: Damerval, Christophe Modélisation Géométrique & Multirésolution pour l'Image (MGMI) Laboratoire Jean Kuntzmann (LJK) a další

Přispěvatelé: Damerval, Christophe Modélisation Géométrique & Multirésolution pour l'Image (MGMI) Laboratoire Jean Kuntzmann (LJK) a další

Zdroj: https://inria.hal.science/inria-00188421 ; 2007.

Témata: Lispchitz regularity exponent, maxima lines, robustness, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysis, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.10: Applications, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing

Dostupnost: https://inria.hal.science/inria-00188421
https://inria.hal.science/inria-00188421v1/document
https://inria.hal.science/inria-00188421v1/file/RapportRegulariteLipschitzienneTofNov2007.pdf

View record from BASE

Nájsť tento článok vo Web of Science

16

Fast algorithms for computing isogenies between elliptic curves

Autoři: Bostan, Alin Salvy, Bruno Morain, Francois a další

Přispěvatelé: Bostan, Alin Salvy, Bruno Morain, Francois a další

Zdroj: https://inria.hal.science/inria-00091441 ; [Research Report] 2006, pp.28.

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

Relation: info:eu-repo/semantics/altIdentifier/arxiv/cs.CC/0609020; ARXIV: cs.CC/0609020

Dostupnost: https://inria.hal.science/inria-00091441
https://inria.hal.science/inria-00091441/document
https://inria.hal.science/inria-00091441/file/BoMoSaSc06.pdf

View record from BASE

Nájsť tento článok vo Web of Science

17

A near linear algorithm for testing linear separability in two dimensions

Autoři: Contassot-Vivier, Sylvain Elizondo, David Algorithms for the Grid (ALGORILLE) a další

Přispěvatelé: Contassot-Vivier, Sylvain Elizondo, David Algorithms for the Grid (ALGORILLE) a další

Zdroj: EANN 2012 - 13th International Conference on Engineering Applications of Neural Networks ; https://inria.hal.science/hal-00726624 ; EANN 2012 - 13th International Conference on Engineering Applications of Neural Networks, Sep 2012, London, United Kingdom

Témata: Geometry, Linear Separability, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysis, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]

Geografické téma: London, United Kingdom

Dostupnost: https://inria.hal.science/hal-00726624

View record from BASE

Nájsť tento článok vo Web of Science

18

Software Oriented Stream Ciphers Based upon FCSRs in Diversified Mode

Autoři: Berger, Thierry Pierre Minier, Marine Pousse, Benjamin a další

Přispěvatelé: Berger, Thierry Pierre Minier, Marine Pousse, Benjamin a další

Zdroj: Software Oriented Stream Ciphers Based upon FCSRs in Diversified Mode ; Progress in Cryptology - INDOCRYPT 2009 ; https://inria.hal.science/inria-00524359 ; Progress in Cryptology - INDOCRYPT 2009, Dec 2009, New Delhi, India. pp.119-135, ⟨10.1007/978-3-642-10628-6⟩

Témata: stream cipher, FCSRs, software design, cryptanalysis, cryptography, stream ciphers, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysis, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]

Geografické téma: New Delhi, India

Dostupnost: https://inria.hal.science/inria-00524359
https://doi.org/10.1007/978-3-642-10628-6

View record from BASE

Nájsť tento článok vo Web of Science

19

Oblivious Multi-variate Polynomial Evaluation

Autoři: Gavin, Gerald Minier, Marine Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS) a další

Přispěvatelé: Gavin, Gerald Minier, Marine Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS) a další

Zdroj: Progress in Cryptology - INDOCRYPT 2009 ; https://inria.hal.science/inria-00524361 ; Progress in Cryptology - INDOCRYPT 2009, Dec 2009, New Delhi, India. pp.430-442, ⟨10.1007/978-3-642-10628-6_28⟩

Témata: Homomorphic encryption schemes, Oblivious Polynomial Evaluation (OPE), semantic security, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysis, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]