Výsledky vyhľadávania - $K$-approximating sets and functions*

A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy Autor Halman, Nir

“…Given n elements with nonnegative integer weights w=(w1,…,wn), an integer capacity C and positive integer ranges u=(u1,…,un), we consider the counting version…”
Získať plný text

Set-Valued Approximation—Revisited and Improved Autor Levin, David

“…We address the problem of approximating a set-valued function F, where F:[a,b]→K(Rd) given its samples {F(a+ih)}i=0N, with h=(b−a)/N. We revisit an existing…”
Získať plný text

A hybrid genetic—instance based learning algorithm for CE-QUAL-W2 calibration Autor Ostfeld, Avi, Salomons, Shani

“…; the k-Nearest Neighbor algorithm (kNN)—for approximating the objective function response surface…”
Získať plný text

Gram Points in the Universality of the Dirichlet Series with Periodic Coefficients Autor Šiaučiūnas, Darius, Tekorė, Monika

“… We prove that the set of such shifts approximating a given analytic function is infinite…”
Získať plný text

Approximation of analytic functions by generalized discrete shifts of the Lerch zeta-function Autor Laurinčikas, Antanas, Mikalauskaitė, Toma, Šiaučiūnas, Darius

“… }, a ≠ 0, is uniformly distributed modulo 1. We obtain that the set of above shifts approximating every analytic function from a certain set has a positive lower…”
Získať plný text

Universality in Short Intervals of the Riemann Zeta-Function Twisted by Non-Trivial Zeros Autor Laurinčikas, Antanas, Šiaučiūnas, Darius

“… ζ(s+ihγk), h>0, approximating any non-vanishing analytic function defined in the strip {s∈C:1/2<Res<1} with accuracy ε…”
Získať plný text

Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets Autor Korda, Milan, Henrion, Didier

“…Moment-sum-of-squares hierarchies of semidefinite programs can be used to approximate the volume of a given compact basic semialgebraic set K…”
Získať plný text

Learning classes of approximations to non-recursive functions Autor Stephan, Frank, Zeugmann, Thomas

“… By showing B to be not in NUM we resolve this old problem. Moreover, variants of this problem obtained by approximating any given recursively enumerable set A instead of the halting problem K are studied…”
Získať plný text

Sets of approximating functions with finite Vapnik–Chervonenkis dimension for nearest-neighbors algorithms Autor KLCSK, P, KORZEN, M

“…) of nearest neighbors is used. Owing to this reformulation one can construct sets of approximating functions, which we prove…”
Získať plný text

Approximating a set of points by a step function Autor Mayster, Yan, Lopez, Mario A.

“…Let S be a set of n points in the plane. We derive algorithms for approximating S by a step function of size k < n, i.e…”
Získať plný text

A Geometric Approach to Polynomial and Rational Approximation Autor Bishop, Christopher J, Lazebnik, Kirill

“… In particular, when approximating a function \(f\) on a compact set \(K\), the critical points of our approximants may be taken to lie in any given domain containing \(K…”
Získať plný text

Principal eigenvalues for k-Hessian operators by maximum principle methods Autor Birindelli, Isabeau, R. Payne, Kevin

“… for which {\em admissible viscosity supersolutions} obey a minimum principle. The admissibility condition is phrased in terms of the natural closed convex cone $\Sigma_k \subset \Ss(N)$ which is an {\em elliptic set…”
Získať plný text

Minimax and Maximin Fitting of Geometric Objects to Sets of Points Autor Mayster, Yan

“… Let S be a set of n points in the plane. We derive algorithms for approximating S by a step function curve of size k < n, i.e…”
Získať plný text

Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets Autor Korda, Milan, Henrion, Didier

“…Moment-sum-of-squares hierarchies of semidefinite programs can be used to approximate the volume of a given compact basic semialgebraic set K…”
Získať plný text

Sketching and Clustering Metric Measure Spaces Autor Mémoli, Facundo, Sidiropoulos, Anastasios, Singhal, Kritika

“…) into k clusters, minimizing some objective function f. Sketching, on the other hand, is the problem of approximating some mm-space by a smaller one supported on a set of k points…”
Získať plný text