Výsledky vyhľadávania - "Algorithms—algebraic algorithms"
-
1
Arjun: An Efficient Independent Support Computation Technique and its Applications to Counting and Sampling
ISSN: 1558-2434Vydavateľské údaje: ACM 29.10.2022Vydané 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ískať plný text
Konferenčný príspevok.. -
2
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP
Vydavateľské údaje: IEEE 29.06.2021Vydané 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). We unify,…”
Získať plný text
Konferenčný príspevok.. -
3
First-Order Reasoning and Efficient Semi-Algebraic Proofs
Vydavateľské údaje: IEEE 29.06.2021Vydané 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ískať plný text
Konferenčný príspevok.. -
4
Constraint Satisfaction Problems over Finite Structures
Vydavateľské údaje: IEEE 29.06.2021Vydané 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ískať plný text
Konferenčný príspevok.. -
5
Measurable Spaces and Their Effect Logic
ISBN: 1479904139, 9781479904136ISSN: 1043-6871Vydavateľské údaje: IEEE 01.06.2013Vydané 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ískať plný text
Konferenčný príspevok.. -
6
Scaling betweenness centrality using communication-efficient sparse matrix multiplication
ISBN: 9781450351140, 145035114XISSN: 2167-4337Vydavateľské údaje: New York, NY, USA ACM 12.11.2017Vydané v International Conference for High Performance Computing, Networking, Storage and Analysis (Online) (12.11.2017)“…Betweenness centrality (BC) is a crucial graph problem that measures the significance of a vertex by the number of shortest paths leading through it. We…”
Získať plný text
Konferenčný príspevok.. -
7
Solving difficult SAT instances in the presence of symmetry
ISBN: 1581134614, 9781581134612ISSN: 0738-100XVydavateľské údaje: New York, NY, USA ACM 10.06.2002Vydané 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. Most of the classic DIMACS…”
Získať plný text
Konferenčný príspevok.. -
8
Division-free computation of subresultants using Bezout matrices
ISSN: 0020-7160, 1029-0265Vydavateľské údaje: Abingdon Taylor & Francis 01.12.2009Vydané 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…”
Získať plný text
Journal Article -
9
AmgT: Algebraic Multigrid Solver on Tensor Cores
Vydavateľské údaje: IEEE 17.11.2024Vydané v SC24: International Conference for High Performance Computing, Networking, Storage and Analysis (17.11.2024)“…Algebraic multigrid (AMG) methods are particularly efficient to solve a wide range of sparse linear systems, due to their good flexibility and adaptability…”
Získať plný text
Konferenčný príspevok.. -
10
Computing semi-algebraic invariants for polynomial dynamical systems
ISBN: 1450307140, 9781450307147Vydavateľské údaje: New York, NY, USA ACM 09.10.2011Vydané 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ískať plný text
Konferenčný príspevok.. -
11
STM-Multifrontal QR: Streaming Task Mapping Multifrontal QR Factorization Empowered by GCN
ISSN: 2167-4337Vydavateľské údaje: ACM 14.11.2021Vydané 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…”
Získať plný text
Konferenčný príspevok.. -
12
A Novel Unified Architecture for Public-Key Cryptography
ISBN: 9780769522883, 0769522882ISSN: 1530-1591Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 07.03.2005Vydané 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ískať plný text
Konferenčný príspevok.. -
13
Exact Synthesis of 3-Qubit Quantum Circuits from Non-Binary Quantum Gates Using Multiple-Valued Logic and Group Theory
ISBN: 9780769522883, 0769522882ISSN: 1530-1591Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 07.03.2005Vydané v Design, Automation and Test in Europe (07.03.2005)“…We propose an approach to optimally synthesize quantum circuits from non-permutative quantum gates such as Controlled-Square-Root-of-Not (i.e. Controlled-V)…”
Získať plný text
Konferenčný príspevok.. -
14
A Faster Counterexample Minimization Algorithm Based on Refutation Analysis
ISBN: 9780769522883, 0769522882ISSN: 1530-1591Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 07.03.2005Vydané v Design, Automation and Test in Europe (07.03.2005)“…It is a hot research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. The BFL algorithm is the most effective…”
Získať plný text
Konferenčný príspevok.. -
15
Detecting Bacterial Vaginosis Using Machine Learning
Vydavateľské údaje: United States 01.03.2014Vydané v Proceedings of the 2014 ACM Southeast Regional Conference (01.03.2014)“…Bacterial Vaginosis (BV) is the most common of vaginal infections diagnosed among women during the years where they can bear children. Yet, there is very…”
Zistit podrobnosti o prístupe
Journal Article -
16
Bound Set Selection and Circuit Re-Synthesis for Area/Delay Driven Decomposition
ISBN: 9780769522883, 0769522882ISSN: 1530-1591Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 07.03.2005Vydané 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ískať plný text
Konferenčný príspevok.. -
17
Distributed consensus and linear functional calculation in networks: an observability perspective
ISBN: 9781595936387, 1595936386Vydavateľské údaje: New York, NY, USA ACM 25.04.2007Vydané v Proceedings of the 6th international conference on Information processing in sensor networks (25.04.2007)“…We study the problem of performing sensor fusion and distributed consensus in networks, where the objective is to calculate some linear function of the initial…”
Získať plný text
Konferenčný príspevok.. -
18
On the unification of query algebras and their extension to rational tree structures
ISBN: 9780769509662, 0769509665ISSN: 1530-0919Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 29.01.2001Vydané v ACM International Conference Proceeding Series; Vol. 10: Proceedings of the 12th Australasian database conference : Queensland, Australia; 29 Jan.-01 Feb. 2001 (29.01.2001)“…In order to come to a unification of existing query algebras, especially for object bases, it is necessary to understand the semantic differences between…”
Získať plný text
Konferenčný príspevok.. -
19
Surface representations using blossoms and buds
ISBN: 9781424422609, 1424422604Vydavateľské údaje: IEEE 01.06.2008Vydané v 2008 IEEE International Conference on Shape Modeling and Applications (01.06.2008)“…Shape representations using polynomials in computer-aided geometric design (CAGD) and computer graphics are ubiquitous. This paper shows that any bivariate…”
Získať plný text
Konferenčný príspevok.. -
20
Computer algebra and desuspensions of stunted real projective spaces
ISSN: 0020-7160, 1029-0265Vydavateľské údaje: Abingdon Gordon and Breach Science Publishers 01.01.1992Vydané v International journal of computer mathematics (01.01.1992)“…In this work we apply computer algebra methods to partially solve a geometric problem which arises in algebraic topology. This is related to a particularly…”
Získať plný text
Journal Article

