Výsledky vyhledávání - f.2.1 numerical algorithms and problems _ words~
-
1
Autoři:
Přispěvatelé:
Zdroj: ftp://ftp-sop.inria.fr/saga/emiris/publis/CEjacm.ps.gz
Témata: 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
Popis souboru: application/postscript
-
2
Autoři:
Přispěvatelé:
Témata: 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
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.487; http://www.nada.kth.se/%7Ejohanh/hnrsaacm.pdf
-
3
Autoři:
Přispěvatelé:
Témata: ACM CCS Categories and Subject Descriptors, F.2.1 Numerical Algorithms and Problems Key words, Design of Algorithms, Data Streams, Time Series, Latency, Monotonicity
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.1902; http://arxiv.org/pdf/cs/0610046v4.pdf
-
4
Autoři:
Přispěvatelé:
Témata: 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
Popis souboru: 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
-
5
Autoři: a další
Zdroj: INFORMS Journal on Computing; Jan/Feb2025, Vol. 37 Issue 1, p107-124, 18p
-
6
Autoři:
Přispěvatelé:
Témata: ACM CCS Categories and Subject Descriptors, F.2.1 Numerical Algorithms and Problems Key words, Design of Algorithms, Data Streams, Time Series, Latency, Monotonicity
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.6173; http://www.archipel.uqam.ca/309/01/webmaximinalgo.pdf
-
7
Autoři: a další
Zdroj: Operations Research; Nov/Dec2024, Vol. 72 Issue 6, p2631-2664, 34p
-
8
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, F.2.1 [Analysis of Algorithms andProblemComplexity, Numerical Algorithms and Problems—Computations in finite fields General Terms, Algorithms, Theory Additional Key Words and Phrases, Combinatorial optimization, exact linear algebra, matrix rank, random- ized algorithm ACM Reference Format
Popis souboru: application/pdf
-
9
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems, H.2.m [Database Management, Miscellaneous General Terms, Theory Additional Key Words and Phrases, Inconsistent Databases, Aggregate Constraints, Repairs, Consistent Query Answer
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.5739; http://www.acm.org/tods/accepted/2010/FlescaQuerying.pdf
-
10
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.1 [Analysis of Algorithms and Problems Complexity, Numerical Algorithms and Problems, G.1.6 [Numerical Analysis, Optimization—linear programming General Terms, Algorithms, Theory Additional Key Words and Phrases, Simplex method, smoothed analysis, complexity, perturbation
Popis souboru: application/pdf
-
11
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, B.2.4 [High-speed Arithmetic, Algorithms—Algorithms, Cost/Performance, F.2.1 [Analysis Of Algorithms And Problem Complexity, Numerical Algorithms and Problems—Number-theoretic computations, I.1.2 [Symbolic And Algebraic Manipulation, Algorithms—Algebraic Algorithms General Terms, Algorithms, Design, Performance, Theory Additional Key Words and Phrases, addition chains, directed graph, fixed-point arithmetic, strength reduction
Popis souboru: application/pdf
-
12
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, D.3.2 [Programming Languages, Language Classifications—Fortran 77, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Computations on matrices, G.1.3 [Numerical Analysis, Numerical Linear Algebra—Eigenvalues and eigenvectors (direct and iterative methods, G.4 [Mathematics of Computing, Mathematical Software—Algorithm design and analysis, Certification and testing, Documentation, Efficiency, Reliability and robustness General Terms, Algorithms, Performance Additional Key Words and Phrases, Algebraic Riccati equation, eigenvalues, Hamiltonian matrix, invariant subspaces, skew-Hamiltonian matrix, symplectic QR decomposition
Popis souboru: application/pdf
-
13
Autoři: Hallgren, Sean
Zdroj: Journal of the ACM; Mar2007, Vol. 54 Issue 1, p1-19, 19p, 4 Charts
-
14
Autoři:
Přispěvatelé:
Témata: analysis, Parallel and vector implementations, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems – Computations on matrices General Terms, Algorithms, Performance Additional Key Words and Phrases, Block-tridiagonal matrix, approximate eigenvalues, block divide-andconquer, orthogonal block reduction
Popis souboru: application/pdf
-
15
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, H.2.7 [Database Management, Database Administration, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems General Terms, Algorithms, Security, Theory Additional Key Words and Phrases, privacy, disclosure, auditing, query logs, reasoning about knowledge, supermodularity, Positivstellensatz
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.5447; http://www.almaden.ibm.com/cs/people/sasha/manuscripts/2008_PODS_expanded_draft.pdf
-
16
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems General Terms, Algorithms, Theory Additional Key Words and Phrases, sketching, dimensionality reduction, embeddings, data streams
Popis souboru: application/pdf
-
17
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic, H.2.8 [Database Management, Database Applications, I.1.1 [Symbolic and Algebraic Manipulation, Expressions and Their Representation General Terms, Languages, Theory Additional Key Words and Phrases, First-order logic, denable sets, variable independence, polynomial constraints, linear constraints, spatio-temporal databases
Popis souboru: application/postscript
-
18
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problem Complexity, I.1.2 [Algebraic Manipulation, Algorithms General Terms, Algorithms Additional Key Words and Phrases, Cubic surface modeling, dual form representations, graphics display, numeric and symbolic computation, rational parametrization
-
19
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.1.2 [Computation by Abstract Devices, Modes of Computation, F.1.3 [Computation by Abstract Devices, Complexity Classes, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems, F.2.2 [Analysis of Algorithms and Problem Complexity, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic General Terms, Algorithms, Theory, Verification Additional Key Words and Phrases, Approximation algorithms, complexity hierarchies, computations on polynomials and finite fields
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.9739; http://ww2.cs.fsu.edu/~mcdonald/docs/probCheck.pdf
-
20
Autoři:
Zdroj: Journal of the ACM; Jul2007, Vol. 54 Issue 4, p1-19, 19p
Nájsť tento článok vo Web of Science 
Full Text Finder