Results 11 to 20 of about 856,973 (319)
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.
Irmi Sax +5 more
openaire +2 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 +2 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.
Frank Müller, Werner Varnhorn
openaire +1 more source
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. This quest for better approximation algorithms is further fueled by
Maria-Florina Balcan +2 more
openaire +1 more source
Approximating Approximate Pattern Matching
CoRR, 2018 ISSN:1868 ...
Jan Studený, Przemyslaw Uznanski
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
Estimates of the Approximation Error Using Rademacher Complexity: Learning Vector-Valued Functions [PDF]
, 2008 For certain families of multivariable vector-valued functions to be approximated, the accuracy of approximation schemes made up of linear combinations of computational units containing adjustable parameters is investigated.
Gnecco Giorgio +7 more
core +1 more source
Advanced Engineering Research, 2014 A solution to the problem on describing experimentally obtained dependences is considered. The autho r’s method is based upon getting some local approximations of fragments of these relations, and their additive reduction to a single analytical ...
Rudolf Anatolyevich Neydorf
doaj +1 more source
Efficient approximation of random fields for numerical applications [PDF]
, 2014 This article is dedicated to the rapid computation of separable expansions for the approximation of random fields. We consider approaches based on techniques from the approximation of non-local operators on the one hand and based on the pivoted Cholesky ...
Michael Peters +5 more
core +1 more source
A Comparison between Fixed-Basis and Variable-Basis Schemes for Function Approximation and Functional Optimization [PDF]
, 2012 Fixed-basis and variable-basis approximation schemes are compared for the problems of function approximation and functional optimization (also known as infinite programming).
Gnecco, Giorgio +3 more
core +1 more source