Results 11 to 20 of about 450,436 (269)
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 +3 more sources
Approximating Approximate Distance Oracles
CoRR, 2016 Given a finite metric space $(V,d)$, an approximate distance oracle is a data structure which, when queried on two points $u,v \in V$, returns an approximation to the the actual distance between $u$ and $v$ which is within some bounded stretch factor of the true distance.
Michael Dinitz, Zeyu Zhang 0003
openaire +4 more sources
IEEE Access, 2023 The radial basis function (RBF) neural network is a type of universal approximator, and has been widely used in various fields. Improving the training speed and compactness of RBF networks are critical for promoting their applications.
Lifei Sun +6 more
doaj +1 more source
Applied Categorical Structures, 2017 In a locally $λ$-presentable category, with $λ$ a regular cardinal, classes of objects that are injective with respect to a family of morphisms whose domains and codomains are $λ$-presentable, are known to be characterized by their closure under products, $λ$-directed colimits and $λ$-pure subobjects.
Jirí Rosický, Walter Tholen
openaire +3 more sources
On approximately monotone and approximately Hölder functions [PDF]
Periodica Mathematica Hungarica, 2020 AbstractA real valued functionfdefined on a real open intervalIis called$$\Phi $$Φ-monotone if, for all$$x,y\in I$$x,y∈Iwith$$x\le y$$x≤yit satisfies$$\begin{aligned} f(x)\le f(y)+\Phi (y-x), \end{aligned}$$f(x)≤f(y)+Φ(y-x),where$$ \Phi :[0,\ell (I) [ \rightarrow \mathbb {R}_+$$Φ:[0,ℓ(I)[→R+is a given nonnegative error function, where$$\ell (I)$$ℓ(I ...
Angshuman R. Goswami, Zsolt Páles
openaire +3 more sources