Results 1 to 10 of about 149 (149)
Approximate approximation on a quantum annealer [PDF]
Proceedings of the 17th ACM International Conference on Computing Frontiers, 2020 Many problems of industrial interest are NP-complete, and quickly exhaust resources of computational devices with increasing input sizes. Quantum annealers (QA) are physical devices that aim at this class of problems by exploiting quantum mechanical properties of nature.
Thomas Gabor +5 more
openaire +3 more sources
An approximation method using approximate approximations [PDF]
Applicable Analysis, 2006 The aim of this article is to extend the method of approximate approximations to boundary value problems. This method was introduced by V. Maz'ya in 1991 and has been used until now for the approximation of smooth functions defined on the whole space and for the approximation of volume potentials.
Werner Varnhorn, Frank Müller
openaire +2 more sources
Proceedings of the 2020 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, 2020 A rollback operation in a speculative parallel discrete event simulator has historically targeted the perfect reconstruction of the state to be restored after a timestamp order violation. This imposes that the rollback support entails specific capabilities and consequently pays given costs.
Principe, Matteo +3 more
openaire +6 more sources
An Approximation Algorithm for Approximation Rank [PDF]
2009 24th Annual IEEE Conference on Computational Complexity, 2009 One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix--the minimum rank of a matrix which is entrywise close to the communication matrix.
Troy Lee, Adi Shraibman
openaire +3 more sources
On treewidth approximations [PDF]
Electronic Notes in Discrete Mathematics, 2001 AbstractWe introduce a natural heuristic for approximating the treewidth of graphs. We prove that this heuristic gives a constant factor approximation for the treewidth of graphs with bounded asteroidal number. Using a different technique, we give a O(logk) approximation algorithm for the treewidth of arbitrary graphs, where k is the treewidth of the ...
Bouchitté, Vincent +3 more
openaire +6 more sources
Approximate Clustering without the Approximation [PDF]
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009 Approximation algorithms for clustering points in metric spaces is a flourishing area of research, with much research effort spent on getting a better understanding of the approximation guarantees possible for many objective functions such as k-median, k-means, and min-sum clustering.
Maria-Florina Balcan +2 more
openaire +2 more sources
S-Approximation: A New Approach to Algebraic Approximation [PDF]
Journal of Discrete Mathematics, 2014 We intend to study a new class of algebraic approximations, called S-approximations, and their properties. We have shown that S-approximations can be used for applied problems which cannot be modeled by inclusion based approximations. Also, in this work, we studied a subclass of S-approximations, called Sℳ-approximations, and showed that this subclass ...
Hooshmandasl, M. R. +3 more
openaire +4 more sources
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022 For a function $g\colon\{0,1\}^m\to\{0,1\}$, a function $f\colon \{0,1\}^n\to\{0,1\}$ is called a $g$-polymorphism if their actions commute: $f(g(\mathsf{row}_1(Z)),\ldots,g(\mathsf{row}_n(Z))) = g(f(\mathsf{col}_1(Z)),\ldots,f(\mathsf{col}_m(Z)))$ for all $Z\in\{0,1\}^{n\times m}$.
Chase, Gilad +4 more
openaire +2 more sources
Approximate identities in approximate amenability
Journal of Functional Analysis, 2012 AbstractWe answer several open questions in the theory of approximate amenability for Banach algebras. First we give examples of Banach algebras which are boundedly approximately amenable but which do not have bounded approximate identities. This answers a question open since the year 2000 when Ghahramani and Loy founded the notion of approximate ...
Charles John Read, F. Ghahramani
openaire +2 more sources
Approximations of Mappings [PDF]
, 2019 We consider mappings, which are structure consisting of a single function (and possibly some number of unary relations) and address the problem of approximating a continuous mapping by a finite mapping. This problem is the inverse problem of the construction of a continuous limit for first-order convergent sequences of finite mappings.
Patrice Ossona de Mendez +2 more
openaire +4 more sources