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

  • Zobrazené výsledky 1 - 16 z 16
Upresniť hľadanie
  1. 1

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

    ISSN: 0304-3975, 1879-2294
    Vydavateľské údaje: Elsevier B.V 13.09.2016
    Vydané v Theoretical computer science (13.09.2016)
    “…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
    Journal Article
  2. 2

    k-approximating circuits Autor Cadoli, M., Donini, F.M., Liberatore, P., Schaerf, M.

    ISSN: 0018-9340, 1557-9956
    Vydavateľské údaje: New York IEEE 01.07.2006
    Vydané v IEEE transactions on computers (01.07.2006)
    “…In this paper, we define and study the k-approximating circuits. A circuit accepting a given set of inputs A is k-approximated by accepting inputs that lifter from one of A by at most k bits…”
    Získať plný text
    Journal Article
  3. 3

    Optimality conditions for a nonconvex set-valued optimization problem Autor Alonso, María, Rodríguez-Marín, Luis

    ISSN: 0898-1221, 1873-7668
    Vydavateľské údaje: Elsevier Ltd 01.07.2008
    “… Convexity of the multifunction and the domain is not required. A definition of K -approximating multifunction is introduced…”
    Získať plný text
    Journal Article
  4. 4

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

    ISSN: 2227-7390, 2227-7390
    Vydavateľské údaje: Basel MDPI AG 04.04.2025
    Vydané v Mathematics (Basel) (04.04.2025)
    “…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
    Journal Article
  5. 5

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

    ISSN: 0022-1694, 1879-2707
    Vydavateľské údaje: Amsterdam Elsevier B.V 01.08.2005
    Vydané v Journal of hydrology (Amsterdam) (01.08.2005)
    “…; the k-Nearest Neighbor algorithm (kNN)—for approximating the objective function response surface…”
    Získať plný text
    Journal Article
  6. 6

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

    ISSN: 0363-1672, 1573-8825
    Vydavateľské údaje: New York Springer US 01.04.2025
    Vydané v Lithuanian mathematical journal (01.04.2025)
    “… }, 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
    Journal Article
  7. 7

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

    ISSN: 2227-7390, 2227-7390
    Vydavateľské údaje: Basel MDPI AG 01.11.2023
    Vydané v Mathematics (Basel) (01.11.2023)
    “… We prove that the set of such shifts approximating a given analytic function is infinite…”
    Získať plný text
    Journal Article
  8. 8

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

    ISSN: 2227-7390, 2227-7390
    Vydavateľské údaje: MDPI AG 01.11.2020
    Vydané v Mathematics (Basel) (01.11.2020)
    “… ζ(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
    Journal Article
  9. 9

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

    ISSN: 1862-4472, 1862-4480
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2018
    Vydané v Optimization letters (01.05.2018)
    “…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
    Journal Article
  10. 10

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

    ISSN: 0304-3975, 1879-2294
    Vydavateľské údaje: Amsterdam Elsevier B.V 16.10.2002
    Vydané v Theoretical computer science (16.10.2002)
    “… 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
    Journal Article Konferenčný príspevok..
  11. 11

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

    ISSN: 0167-8655, 1872-7344
    Vydavateľské údaje: Amsterdam Elsevier B.V 15.10.2011
    Vydané v Pattern recognition letters (15.10.2011)
    “…) of nearest neighbors is used. Owing to this reformulation one can construct sets of approximating functions, which we prove…”
    Získať plný text
    Journal Article
  12. 12

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

    ISSN: 1047-3203, 1095-9076
    Vydavateľské údaje: Elsevier Inc 01.12.2006
    “…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
    Journal Article
  13. 13

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

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 11.02.2023
    Vydané v arXiv.org (11.02.2023)
    “… 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
    Paper
  14. 14

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

    ISSN: 2640-3501, 2640-3501
    Vydavateľské údaje: AIMS Press 01.01.2021
    Vydané v Mathematics in engineering (01.01.2021)
    “… 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
    Journal Article
  15. 15

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

    ISBN: 9781124958545, 1124958541
    Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2011
    “… 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
    Dissertation
  16. 16

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

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 13.12.2016
    Vydané v arXiv.org (13.12.2016)
    “…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
    Paper