Výsledky vyhledávání - f.2.1 numerical algorithms AND problems _ works*

Graph Sparsification by Approximate matrix Multiplication

Autoři: Charalambides, Neophytos Hero III, Alfred O.

Zdroj: 2023 IEEE Statistical Signal Processing Workshop (SSP). :180-184

Témata: Signal Processing (eess.SP), FOS: Computer and information sciences, Discrete Mathematics (cs.DM), G.3, G.1.2, G.1.3, G.2.2, Numerical Analysis (math.NA), 0102 computer and information sciences, F.2.1, 01 natural sciences, Mathematics - Spectral Theory, Computer Science - Data Structures and Algorithms, FOS: Mathematics, FOS: Electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Mathematics - Numerical Analysis, Electrical Engineering and Systems Science - Signal Processing, 65F50 65F50, 65F55, 68W20, 68W25, 05C90, 05C50, 05C85, 0101 mathematics, Spectral Theory (math.SP), Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/abs/2304.08581

Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision

Autoři: Koiran, Pascal Saha, Subhayan

Přispěvatelé: Koiran, Pascal Saha, Subhayan

Zdroj: Lecture Notes in Computer Science ISBN: 9783031304477

Témata: FOS: Computer and information sciences, F.2.1, G.1.3, 0102 computer and information sciences, Numerical Analysis (math.NA), [INFO] Computer Science [cs], Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, 68W40, 65F22, 68Q87, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Mathematics - Numerical Analysis, 0101 mathematics

Přístupová URL adresa: http://arxiv.org/abs/2211.07407
https://hal.science/hal-04636846v1
https://doi.org/10.1007/978-3-031-30448-4_22

64-bit floating-point FPGA matrix multiplication

Autoři: Yong Dou S. Vassiliadis G. K. Kuzmanov a další

Přispěvatelé: Yong Dou S. Vassiliadis G. K. Kuzmanov a další

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

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

Popis souboru: 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

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

Randomized Accuracy-Aware Program Transformations For Efficient Approximate Computations

Autoři: Zeyuan Allen Zhu Sasa Misailovic Jonathan A. Kelner a další

Přispěvatelé: Zeyuan Allen Zhu Sasa Misailovic Jonathan A. Kelner a další

Zdroj: http://people.csail.mit.edu/rinard/paper/popl12.pdf.

Témata: Probabilistic Algorithms, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems General Terms Algorithms, Design, Performance, Theory Keywords Optimization, Error-Time Tradeoff, Discretization, Probabilistic

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.294.6947; http://people.csail.mit.edu/rinard/paper/popl12.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.294.6947
http://people.csail.mit.edu/rinard/paper/popl12.pdf

On Lacunary Polynomial Perfect Powers

Autoři: Mark Giesbrecht Daniel S: ROche The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Mark Giesbrecht Daniel S: ROche The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.uwaterloo.ca/~mwg/research/files/lacunary-pp.pdf.

Témata: Categories and Subject Descriptors I.1.2 [Symbolic and Algebraic Manipulation, Algorithms—Algebraic algorithms, Analysis of algorithms, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Computations on polynomials, Number-theoretic computations General Terms Algorithms Keywords Lacunary polynomial, black box polynomial, sparse polynomial, perfect

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.6774
http://www.cs.uwaterloo.ca/~mwg/research/files/lacunary-pp.pdf

QHDOPT: A Software for Nonlinear Optimization with Quantum Hamiltonian Descent.

Autoři: Kushnir, Samuel Leng, Jiaqi Peng, Yuxiang a další

Zdroj: INFORMS Journal on Computing; Jan/Feb2025, Vol. 37 Issue 1, p107-124, 18p

Témata: DATA libraries, QUANTUM computing, OPERATIONS research, NONLINEAR equations, AIR forces

Assortment Optimization Under the Multi-Purchase Multinomial Logit Choice Model.

Autoři: Bai, Yicheng Feldman, Jacob Segev, Danny a další

Zdroj: Operations Research; Nov/Dec2024, Vol. 72 Issue 6, p2631-2664, 34p

Témata: POLYNOMIAL time algorithms, LOGISTIC regression analysis, BUSINESS revenue, POLYNOMIAL approximation, CONSUMER preferences

Polynomial-Time Quantum Algorithms for Pell's Equation and the Principal Ideal Problem.

Autoři: Hallgren, Sean

Zdroj: Journal of the ACM; Mar2007, Vol. 54 Issue 1, p1-19, 19p, 4 Charts

Témata: ALGORITHMS, NUMBER theory, PELL'S equation, RIEMANN hypothesis, ALGEBRA, QUADRATIC fields

Sampling from Large Matrices: An Approach through Geometric Functional Analysis.

Autoři: Rudelson, Mark Vershynin, Roman

Zdroj: Journal of the ACM; Jul2007, Vol. 54 Issue 4, p1-19, 19p

Témata: MATRICES (Mathematics), FUNCTIONAL analysis, GEOMETRY, APPROXIMATION theory, BANACH spaces, ALGORITHMS

Solving low-density subset sum problems

Autoři: J. C. Lagarias A. M. Odlyzko The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: J. C. Lagarias A. M. Odlyzko The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.busim.ee.boun.edu.tr/~mihcak/teaching/ee684-spring07/proposed-project-papers/hard-problems/subset-sum/p229-lagarias.pdf.

Témata: Categories and Subject Descriptors, E.3 [Data Encryption, Public Key Cryptosystems, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems-number-theoretic computations, G.2.0 [Discrete Mathematics, General General Terms, Algorithms, Theory Additional Key Words and Phrases, Knapsack public-key cryptosystem, subset sum problems, integer lattice

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.7057
http://www.busim.ee.boun.edu.tr/~mihcak/teaching/ee684-spring07/proposed-project-papers/hard-problems/subset-sum/p229-lagarias.pdf

Randomized Accuracy-Aware Program Transformations For Efficient Approximate Computations

Autoři: Zeyuan Allen Zhu Sasa Misailovic Jonathan a další

Přispěvatelé: Zeyuan Allen Zhu Sasa Misailovic Jonathan a další

Zdroj: http://people.csail.mit.edu/misailo/papers/popl12.pdf.

Témata: tics, Probabilistic Algorithms, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems General Terms Algorithms, Design, Performance, Theory Keywords Optimization, Error-Time Tradeoff, Discretization, Probabilistic

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.649.2928; http://people.csail.mit.edu/misailo/papers/popl12.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.649.2928
http://people.csail.mit.edu/misailo/papers/popl12.pdf

Dynamic Batch Learning in High-Dimensional Sparse Linear Contextual Bandits.

Autoři: Ren, Zhimei Zhou, Zhengyuan

Zdroj: Management Science; Feb2024, Vol. 70 Issue 2, p1315-1342, 28p

Témata: ROBBERS, DIGITAL twin, RESEARCH grants, TWIN studies, ONLINE education

Korporace: BAIN & Co. Inc., NEW York University, NATIONAL Science Foundation (U.S.)

From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm.

Autoři: Xu, Guoliang Qiu, Daowen

Zdroj: Quantum Information Processing; Jan2021, Vol. 20 Issue 1, p1-16, 16p

A General Framework for Bandit Problems Beyond Cumulative Objectives.

Autoři: Cassel, Asaf Mannor, Shie Zeevi, Assaf

Zdroj: Mathematics of Operations Research; Nov2023, Vol. 48 Issue 4, p2196-2232, 37p

Témata: REINFORCEMENT learning, ROBBERS, SHARPE ratio, EUROPEAN communities, STATISTICAL decision making

Korporace: EUROPEAN Community

Software Reliability via Run-Time Result-Checking

Autoři: Hal Wasserman Manuel Blum Name Manuel Blum a další

Přispěvatelé: Hal Wasserman Manuel Blum Name Manuel Blum a další

Zdroj: http://http.cs.berkeley.edu/~blum/fourier.ps.

Témata: Categories and Subject Descriptors, D.2.5 [Software Engineering, Testing and Debugging, F.2.1 [Analysis of Algorithms, Numerical Algorithms---Computation of transforms, F.3.1 [Logics and Meanings of Programs, Specifying and Verifying and Reasoning about Programs General Terms, Reliability, Algorithms, Verification Additional Key Words and Phrases, Built-in testing, concurrent error detection, debugging, fault tolerance, Fourier Transform, result-checking, self-correcting

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.4747; http://http.cs.berkeley.edu/~blum/fourier.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.4747
http://http.cs.berkeley.edu/~blum/fourier.ps

Graph Expansion and Communication Costs of Fast Matrix Multiplication.

Autoři: BALLARD, GREY DEMMEL, JAMES HOLTZ, OLGA a další

Zdroj: Journal of the ACM; Dec2012, Vol. 59 Issue 6, p32-23, 23p

Témata: MATRIX multiplications, MATRICES (Mathematics), ALGORITHMS, ARITHMETIC, MATHEMATICS, ALGEBRA

Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision

Autoři: Koiran, Pascal Saha, Subhayan

Témata: Computer Science - Data Structures and Algorithms, Computer Science - Computational Complexity, Mathematics - Numerical Analysis, 68W40, 65F22, 68Q87, F.2.1, G.1.3, text

URL: http://arxiv.org/abs/2211.07407

The Traveling Salesman Problem in Bounded Degree Graphs.

Autoři: Björklund, Andreas Husfeldt, Thore Kaski, Petteri a další

Zdroj: ACM Transactions on Algorithms; 2012, Vol. 8 Issue 2, p18-18:13, 13p

Témata: TRAVELING salesman problem, MATHEMATICAL bounds, GRAPH theory, PROBLEM solving, DYNAMIC programming, POLYNOMIALS, ALGORITHMS

Stable Distributions, Pseudorandom Generators, Embeddings, and Data Stream Computation.

Autoři: Indyk, Piotr

Zdroj: Journal of the ACM; May2006, Vol. 53 Issue 3, p307-323, 17p

Témata: DISTRIBUTION (Probability theory), EMBEDDINGS (Mathematics), ALGEBRAIC geometry, PROBABILITY theory, STATISTICAL reliability

Sparsified SGD with Memory

Autoři: Stich, Sebastian U. Cordonnier, Jean-Baptiste Jaggi, Martin

Témata: FOS: Computer and information sciences, Computer Science - Machine Learning, G.1.6, E.4, Machine Learning (stat.ML), 02 engineering and technology, F.2.1, Machine Learning (cs.LG), Computer Science - Distributed, Parallel, and Cluster Computing, Statistics - Machine Learning, 68W40, 68W15, 90C25, 90C06, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC)

Přístupová URL adresa: http://arxiv.org/abs/1809.07599