Výsledky vyhledávání - Algorithms—algebraic algorithms
-
1
Arjun: An Efficient Independent Support Computation Technique and its Applications to Counting and Sampling
ISSN: 1558-2434Vydáno: ACM 29.10.2022Vydáno v 2022 IEEE/ACM International Conference On Computer Aided Design (ICCAD) (29.10.2022)“…Given a Boolean formula φ over the set of variables X and a projection set \mathcal{P} \subseteq X, then if \mathcal{I} \subseteq \mathcal{P} is independent…”
Získat plný text
Konferenční příspěvek -
2
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP…”
Získat plný text
Konferenční příspěvek -
3
First-Order Reasoning and Efficient Semi-Algebraic Proofs
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms [3…”
Získat plný text
Konferenční příspěvek -
4
Constraint Satisfaction Problems over Finite Structures
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both…”
Získat plný text
Konferenční příspěvek -
5
Accelerated Visualization of Dynamic Molecular Surfaces
ISSN: 0167-7055, 1467-8659Vydáno: Oxford, UK Blackwell Publishing Ltd 01.06.2010Vydáno v Computer graphics forum (01.06.2010)“… First, we adopt a parallel approximate Voronoi diagram algorithm to compute the MSS. This accelerates the MSS computation by more than one order of magnitude…”
Získat plný text
Journal Article -
6
Measurable Spaces and Their Effect Logic
ISBN: 1479904139, 9781479904136ISSN: 1043-6871Vydáno: IEEE 01.06.2013Vydáno v 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (01.06.2013)“…So-called effect algebras and modules are basic mathematical structures that were first identified in mathematical physics, for the study of quantum logic and…”
Získat plný text
Konferenční příspěvek -
7
Scaling betweenness centrality using communication-efficient sparse matrix multiplication
ISBN: 9781450351140, 145035114XISSN: 2167-4337Vydáno: New York, NY, USA ACM 12.11.2017Vydáno v International Conference for High Performance Computing, Networking, Storage and Analysis (Online) (12.11.2017)“… through it. We propose Maximal Frontier Betweenness Centrality (MFBC): a succinct BC algorithm based on novel sparse matrix multiplication routines that performs a factor…”
Získat plný text
Konferenční příspěvek -
8
AmgT: Algebraic Multigrid Solver on Tensor Cores
Vydáno: IEEE 17.11.2024Vydáno v SC24: International Conference for High Performance Computing, Networking, Storage and Analysis (17.11.2024)“… This paper proposes AmgT, a new AMG solver that utilizes the tensor core and mixed precision ability of the latest GPUs during multiple phases of the AMG algorithm…”
Získat plný text
Konferenční příspěvek -
9
Analytic gradients in variational quantum algorithms: Algebraic extensions of the parameter-shift rule to general unitary transformations
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 19.12.2021Vydáno v arXiv.org (19.12.2021)“…Optimization of unitary transformations in Variational Quantum Algorithms benefits highly from efficient evaluation of cost function gradients with respect to amplitudes of unitary generators…”
Získat plný text
Paper -
10
Division-free computation of subresultants using Bezout matrices
ISSN: 0020-7160, 1029-0265Vydáno: Abingdon Taylor & Francis 01.12.2009Vydáno v International journal of computer mathematics (01.12.2009)“…We present an algorithm to compute the subresultant sequence of two polynomials that completely avoids division in the ground domain, generalizing an algorithm given by Abdeljaoued et al. [J. Abdeljaoued, G. Diaz-Toca, and L…”
Získat plný text
Journal Article -
11
Solving difficult SAT instances in the presence of symmetry
ISBN: 1581134614, 9781581134612ISSN: 0738-100XVydáno: New York, NY, USA ACM 10.06.2002Vydáno v Annual ACM IEEE Design Automation Conference: Proceedings of the 39th conference on Design automation : New Orleans, Louisiana, USA; 10-14 June 2002 (10.06.2002)“…Research in algorithms for Boolean satisfiability and their implementations [23, 6] has recently outpaced benchmarking efforts…”
Získat plný text
Konferenční příspěvek -
12
STM-Multifrontal QR: Streaming Task Mapping Multifrontal QR Factorization Empowered by GCN
ISSN: 2167-4337Vydáno: ACM 14.11.2021Vydáno v SC21: International Conference for High Performance Computing, Networking, Storage and Analysis (14.11.2021)“…Multifrontal QR algorithm, which consists of symbolic analysis and numerical factorization, is a high-performance algorithm for orthogonal factorizing sparse matrix…”
Získat plný text
Konferenční příspěvek -
13
Computing semi-algebraic invariants for polynomial dynamical systems
ISBN: 1450307140, 9781450307147Vydáno: New York, NY, USA ACM 09.10.2011Vydáno v Proceedings of the ninth ACM International Conference on Embedded Software (09.10.2011)“…In this paper, we consider an extended concept of invariant for polynomial dynamical systems (PDSs) with domain and initial condition, and establish a sound…”
Získat plný text
Konferenční příspěvek -
14
A Faster Counterexample Minimization Algorithm Based on Refutation Analysis
ISBN: 9780769522883, 0769522882ISSN: 1530-1591Vydáno: Washington, DC, USA IEEE Computer Society 07.03.2005Vydáno v Design, Automation and Test in Europe (07.03.2005)“… The BFL algorithm is the most effective counterexample minimization algorithm compared to all other…”
Získat plný text
Konferenční příspěvek -
15
Detecting Bacterial Vaginosis Using Machine Learning
Vydáno: United States 01.03.2014Vydáno v Proceedings of the 2014 ACM Southeast Regional Conference (01.03.2014)“… The purpose of this paper is two-fold; first to discover the most significant features necessary to diagnose the infection, second is to apply various classification algorithms on the selected features…”
Zjistit podrobnosti o přístupu
Journal Article -
16
A Novel Unified Architecture for Public-Key Cryptography
ISBN: 9780769522883, 0769522882ISSN: 1530-1591Vydáno: Washington, DC, USA IEEE Computer Society 07.03.2005Vydáno v Design, Automation and Test in Europe (07.03.2005)“…In this paper we propose a fully-parallel, bit-sliced unified architecture designed to perform modular multipication/exponentiation and GF(2^M) multiplication…”
Získat plný text
Konferenční příspěvek -
17
Exact Synthesis of 3-Qubit Quantum Circuits from Non-Binary Quantum Gates Using Multiple-Valued Logic and Group Theory
ISBN: 9780769522883, 0769522882ISSN: 1530-1591Vydáno: Washington, DC, USA IEEE Computer Society 07.03.2005Vydáno v Design, Automation and Test in Europe (07.03.2005)“… Assuming a cost of one for each two-qubit gate, we found all reversible circuits with quantum costs of 4, 5, 6, etc, and give another algorithm to realize…”
Získat plný text
Konferenční příspěvek -
18
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra
ISBN: 1475726953, 9781475726954, 9780387946801, 0387946802Vydáno: New York, NY Springer New York 1996“…Algebraic Geometry is the study of systems of polynomial equations in one or more variables, asking such questions…”
Získat plný text
E-kniha -
19
Bound Set Selection and Circuit Re-Synthesis for Area/Delay Driven Decomposition
ISBN: 9780769522883, 0769522882ISSN: 1530-1591Vydáno: Washington, DC, USA IEEE Computer Society 07.03.2005Vydáno v Design, Automation and Test in Europe (07.03.2005)“…This paper addresses two problems related to disjoint-support decomposition of Boolean functions. First, we present a heuristic for finding a subset of…”
Získat plný text
Konferenční příspěvek -
20
The Euler–Lagrange theory for Schur's Algorithm: Algebraic exposed points
ISSN: 0021-9045, 1096-0430Vydáno: Elsevier Inc 01.03.2006Vydáno v Journal of approximation theory (01.03.2006)“…In this paper the ideas of Algebraic Number Theory are applied to the Theory of Orthogonal polynomials for algebraic measures. The transferring tool are Wall…”
Získat plný text
Journal Article

