Search Results - "F.2.1 Numerical Algorithms and Problems"

1

Academic Journal

The Operator Approach to Entropy Games

Authors: Akian, Marianne, Gaubert, Stéphane, Grand-Clément, Julien, Guillaud, Jérémie

Contributors: Akian, Marianne, Marianne Akian and Stéphane Gaubert and Julien Grand-Clément and Jérémie Guillaud, TROPICAL (TROPICAL), Centre de Mathématiques Appliquées de l'Ecole polytechnique (CMAP), Institut National de Recherche en Informatique et en Automatique (Inria)-École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)-Centre Inria de l'Institut Polytechnique de Paris, Centre Inria de Saclay, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre Inria de Saclay, Institut National de Recherche en Informatique et en Automatique (Inria), Columbia University New York, QUANTum Information Circuits (QUANTIC), Mines Paris - PSL (École nationale supérieure des mines de Paris), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Sorbonne Université (SU)-Laboratoire de physique de l'ENS - ENS Paris (LPENS), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)-Département de Physique de l'ENS-PSL, École normale supérieure - Paris (ENS-PSL), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-École normale supérieure - Paris (ENS-PSL), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)-Département de Physique de l'ENS-PSL, Université Paris Sciences et Lettres (PSL)-Centre Inria de Sorbonne Université, Centre Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), The authors were partially supported by the ANR through the MALTHY INS project, and by the Gaspard Monge corporate sponsorship Program (PGMO) of EDF, Orange, Thales and Fondation Mathématique Jacques Hadmard., ANR-13-INSE-0003,MALTHY,Méthodes ALgèbriques pour la vérification de modèles Temporisés et HYbrides(2013)

Source: Theory of Computing Systems. 63:1089-1130

Subject Terms: FOS: Computer and information sciences, Policy iteration, F.2.1 Numerical Algorithms and Problems, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], Shapley operators, policy iteration, 1991 Mathematics Subject Classification. G.2.1 Combinatorial algorithms, Perron eigenvalues, 91A15, 47H05, 93E20, Computer Science - Computer Science and Game Theory, Optimization and Control (math.OC), FOS: Mathematics, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], ddc:004, Stochastic games, Mathematics - Optimization and Control, Risk sensitive control, Computer Science and Game Theory (cs.GT)

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/opus/volltexte/2017/7026/pdf/LIPIcs-STACS-2017-6.pdf
http://arxiv.org/abs/1904.05151
https://inria.hal.science/hal-01676695v1
https://hal.science/hal-02143807v1
https://doi.org/10.1007/s00224-019-09925-z
https://link.springer.com/article/10.1007%2Fs00224-019-09925-z
https://hal.archives-ouvertes.fr/hal-02143807
https://dblp.uni-trier.de/db/journals/corr/corr1904.html#abs-1904-05151
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.6

View record at OpenAIRE View record at Springer

Linked Full Text

2

Academic Journal

A Distributed Information Divergence Estimation over Data Streams

Authors: Anceaume, Emmanuelle, Busnel, Yann

Contributors: Busnel, Yann, CIDER, SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Confidentialité, Intégrité, Disponibilité et Répartition (CIDRE), CentraleSupélec-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-Centre National de la Recherche Scientifique (CNRS), Gestion de Données Distribuées Nantes (GDD), Laboratoire d'Informatique de Nantes Atlantique (LINA), Mines Nantes (Mines Nantes)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS), LabEx CominLabs - Projet Descent ANR-10-LABX-07-01, LINA-GDD, ANR-13-INFR-0003,SocioPlug,Cloud social sur des réseaux de plugs, pour un accès à l'information symétrique et respectueux de la vie privée(2013)

Source: IEEE Transactions on Parallel and Distributed Systems. 25:478-487

Subject Terms: [INFO.INFO-DC]Computer Science [cs]/Distributed, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 02 engineering and technology, E.0.a Data communications aspects < E.0 General < E Data, Parallel, Divergence, and Cluster Computing [cs.DC], Data stream, Randomized approximation algorithm, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, F.2.1 Numerical Algorithms and Problems < F.2 Analysis of Algorithms and Problem Complexity < F Theory of Computation

File Description: application/pdf

Access URL: https://hal.archives-ouvertes.fr/hal-00998708/file/ankle-tpds2013.pdf
https://hal.science/hal-00998708v1/document
https://hal.science/hal-00998708v1
https://doi.org/10.1109/tpds.2013.101
https://dblp.uni-trier.de/db/journals/tpds/tpds25.html#AnceaumeB14
https://hal.archives-ouvertes.fr/hal-00998708
https://ieeexplore.ieee.org/document/6494567
https://hal.inria.fr/hal-00804437
https://hal.archives-ouvertes.fr/hal-00998708/document
http://dblp.uni-trier.de/db/journals/tpds/tpds25.html#AnceaumeB14

View record at OpenAIRE

Linked Full Text

3

Academic Journal

Sub-Linear Root Detection, and New Hardness Results, for Sparse Polynomials Over Finite Fields

Authors: Jingguo Bi, Qi Cheng, J. Maurice Rojas

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://www.math.tamu.edu/~rojas/q.pdf.

Subject Terms: Categories and Subject Descriptors F.2.1 [Numerical Algorithms and Problems, Computations in finite fields, F.1.3 [Complexity Measures and Classes, Reducibility and completeness Keywords Solvability, sparse polynomial, finite fields, NP-hardness, gcd, square-free, discriminant, resultant

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.3034; http://www.math.tamu.edu/~rojas/q.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.3034
http://www.math.tamu.edu/~rojas/q.pdf

View record from BASE

4

Academic Journal

Speeding up Simplification of Polygonal Curves using Nested Approximations

Authors: Marteau, Pierre-François, Ménier, Gildas

Contributors: Laboratoire de Recherche en Informatique et ses Applications de Vannes et Lorient (VALORIA), Université de Bretagne Sud (UBS)

Source: ISSN: 1433-7541.

Subject Terms: Polygonal Approximation, Dynamic programming, Multiresolution, F.2.1 Numerical Algorithms and Problems, G.1.2 Approximation, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/0709.1941; hal-00171706; https://hal.archives-ouvertes.fr/hal-00171706; https://hal.archives-ouvertes.fr/hal-00171706v3/document; https://hal.archives-ouvertes.fr/hal-00171706v3/file/MRShort_v5.pdf; ARXIV: 0709.1941

Availability: https://hal.archives-ouvertes.fr/hal-00171706
https://hal.archives-ouvertes.fr/hal-00171706v3/document
https://hal.archives-ouvertes.fr/hal-00171706v3/file/MRShort_v5.pdf
https://doi.org/10.1007/s10044-008-0133-y

View record from BASE

5

Academic Journal

Fast additions on masked integers

Authors: Michael D. Adams, David S. Wise

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://www.cs.indiana.edu/~dswise/Arcee/Papers/compressedIndices.pdf.

Subject Terms: E.1 [Data Structures, Arrays, D.1.0[Programming Techniques, General, F.2.1[Numerical Algorithms and Problems, Computations on matrices, E.2[Data Storage Representations, contiguous representations. General Terms, Algorithms, Performance Keywords, dilated integers, Morton order, quadtrees, compilers, index arithmetic

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.1801; http://www.cs.indiana.edu/~dswise/Arcee/Papers/compressedIndices.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.1801
http://www.cs.indiana.edu/~dswise/Arcee/Papers/compressedIndices.pdf

View record from BASE

6

Academic Journal

64-bit floating-point FPGA matrix multiplication

Authors: Yong Dou, S. Vassiliadis, G. K. Kuzmanov, G. N. Gaydadjiev

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://www.openhard.org/data/openhard/user/a4e7aa1374588b0f52e95e76961c3162.pdf.

Subject Terms: Categories and Subject Descriptors B.2.4 [Arithmetic and Logic Structures, High-Speed Arithmetic, C.1.3 [Other Architecture Style, Adaptable architectures, F.2.1 [Numerical Algorithms and Problems, Computations on matrices General Terms Algorithms, Design, Performance Keywords Matrix multiplication, Floating-point, FPGA

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.9463; http://www.openhard.org/data/openhard/user/a4e7aa1374588b0f52e95e76961c3162.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.9463
http://www.openhard.org/data/openhard/user/a4e7aa1374588b0f52e95e76961c3162.pdf

View record from BASE

7

Academic Journal

Deterministic Equation Solving over Finite Fields

Authors: Christiaan van de Woestijne

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://www.opt.math.tugraz.at/%7Ecvdwoest/maths/issac2005.pdf.

Subject Terms: F.2.1 [Numerical Algorithms and Problems, Computations in finite fields, G.4 [Mathematical Software, Algorithm design and analysis, I.1.2 [Algorithms, Algebraic algorithms, Analysis of algorithms General Terms Algorithms, Design, Performance Keywords Deterministic algorithms, Equation solving, Finite fields

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.8750; http://www.opt.math.tugraz.at/%7Ecvdwoest/maths/issac2005.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.8750
http://www.opt.math.tugraz.at/%7Ecvdwoest/maths/issac2005.pdf

View record from BASE

8

Academic Journal

Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems (Extended Abstract)

Authors: Daniel A. Spielman, Shang-hua Teng

Contributors: The Pennsylvania State University CiteSeerX Archives

Subject Terms: Categories and Subject Descriptors F.2.1 [Numerical Algorithms and Problems, Computations on matrices, G.1.3 [Numerical Linear Algebra, Linear systems (direct and iterative methods) General Terms Algorithms, Theory Keywords Preconditioners, Graph Partitioning, Graph Sparsification

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.205.2406

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.205.2406

View record from BASE

9

Academic Journal

The Security of all RSA and Discrete Log Bits

Authors: Johan Håstad, Mats Näslund

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://www.nada.kth.se/%7Ejohanh/hnrsaacm.pdf.

Subject Terms: Categories and Subject Descriptors, E.3 [Data Encryption, Public Key Cryptosystems, F.2.1 [Numerical Algorithms and Problems, Number-theoretic computations General Terms, Security, Theory Additional Key Words and Phrases, Cryptography, complexity, RSA-encryption, bit-security, discrete

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.487; http://www.nada.kth.se/%7Ejohanh/hnrsaacm.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.487
http://www.nada.kth.se/%7Ejohanh/hnrsaacm.pdf

View record from BASE

10

Academic Journal

Space-Time Trade-Off Optimization for a Class of Electronic Structure Calculations

Authors: Daniel Cociorva, Gerald Baumgartner, J. Ramanujam, Marcel Nooijen, Chi-chung Lam, David E. Bernholdt, Robert Harrison

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://www.ece.lsu.edu/jxr/papers-pdf/pldi02.pdf.

Subject Terms: Categories and Subject Descriptors F.2.1 [Numerical Algorithms and Problems, Computations on matrices, D.3.2 [Language Classifications, Specialized applica- tion languages, D.3.4 [Processors, Compilers and Optimization, F.2.3 [Tradeoffs between Complexity Measures, J.2 [Physical Sciences and Engineering, Chemistry General Terms Algorithms Keywords Loop fusion, loop transformation, tile size selection

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.583.5768

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.583.5768
http://www.ece.lsu.edu/jxr/papers-pdf/pldi02.pdf

View record from BASE

11

Academic Journal

A Subdivision-Based Algorithm for the Sparse Resultant

Authors: John F. Canny, Ioannis Z. Emiris

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: ftp://ftp-sop.inria.fr/saga/emiris/publis/CEjacm.ps.gz

Subject Terms: Categories and Subject Descriptors, I.1.2 Algorithms (Algebraic algorithms, Analysis of algorithms). F.2.1 Numerical Algorithms and Problems (Computations on matrices, Computations on polynomials). F.2.2 Nonnumerical Algorithms and Problems (Computations on discrete s, Geometrical problems and computations) General Terms, Algorithms, Theory. Additional Key Words and Phrases, Sparse elimination theory, multivariate resultant, Newton polytope, mixed volume, polyhedral subdivision, eoeective Nullstellensatz, asymptotic complexity

File Description: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.4733

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.4733

View record from BASE

12

Academic Journal

Streaming maximum-minimum filter using no more than three comparisons per element,” Nordic

Authors: Daniel Lemire

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://arxiv.org/pdf/cs/0610046v4.pdf.

Subject Terms: ACM CCS Categories and Subject Descriptors, F.2.1 Numerical Algorithms and Problems Key words, Design of Algorithms, Data Streams, Time Series, Latency, Monotonicity

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.1902; http://arxiv.org/pdf/cs/0610046v4.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.1902
http://arxiv.org/pdf/cs/0610046v4.pdf

View record from BASE

13

eBook

Matrix algebra and applicative programming

Authors: Wise, David S.^Aff1

Contributors: Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, Kahn, Gilles, editor

Source: Functional Programming Languages and Computer Architecture : Portland, Oregon, USA, September 14–16, 1987 Proceedings. 274:134-153

14

Academic Journal