Výsledky vyhľadávania - e-complexity of continuous functions

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

    Quickest Detection of Changes in the Generating Mechanism of a Time Series via the E-Complexity of Continuous Functions Autor Darkhovsky, Boris, Piryatinska, Alexandra

    ISSN: 0747-4946, 1532-4176
    Vydavateľské údaje: Philadelphia Taylor & Francis Ltd 01.04.2014
    Vydané v Sequential analysis (01.04.2014)
    “…). The ...-complexity of a continuous function given on a compact segment is defined. The expression for the ...-complexity of functions with the same modulus of continuity is derived…”
    Získať plný text
    Journal Article
  2. 2

    Retrospective technology of segmentation and classification for GARCH models based on the concept of the -complexity of continuous functions Autor Piryatinska, Alexandra, Darkhovsky, Boris

    ISSN: 2769-2140, 2769-2140
    Vydavateľské údaje: AIMS Press 01.09.2022
    Vydané v Data science in finance and economics (01.09.2022)
    “…We consider a retrospective segmentation and classification problem for GARCH models. Segmentation is the partition of a long time series into homogeneous…”
    Získať plný text
    Journal Article
  3. 3

    Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms Autor Bullo, Francesco, Cortés, Jorge, Martínez, Sonia

    ISBN: 9780691141954, 0691141959, 0691146640, 9780691146645, 1400831474, 9781400831470
    Vydavateľské údaje: Princeton, N.J Princeton University Press 2009
    “… The book presents a broad set of tools for understanding coordination algorithms, determining their correctness, and assessing their complexity…”
    Získať plný text
    E-kniha Kniha
  4. 4

    Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms Autor Peng, Jiming, Roos, Cornelis, Terlaky, Tamás

    ISBN: 9780691091921, 0691091927, 0691091935, 9780691091938, 9781400825134, 140082513X
    Vydavateľské údaje: Princeton, N.J. ; Chichester Princeton University Press 2009
    “… and practical performance of these two strategies. This book comes close to bridging that gap, presenting a new framework for the theory of primal-dual IPMs based on the notion of the self-regularity of a function…”
    Získať plný text
    E-kniha Kniha
  5. 5

    The ergodic theory of lattice subgroups Autor Gorodnik, Alexander, Nevo, Amos

    ISBN: 9780691141855, 1400831067, 9781400831067, 0691141843, 9780691141848, 0691141851
    Vydavateľské údaje: Princeton, N.J Princeton University Press 2009
    “…The results established in this book constitute a new departure in ergodic theory and a significant expansion of its scope. Traditional ergodic theorems…”
    Získať plný text
    E-kniha Kniha
  6. 6

    How mathematicians think: using ambiguity, contradiction, and paradox to create mathematics Autor Byers, William

    ISBN: 0691127387, 9780691145990, 9780691127385, 0691145997, 1400833957, 9781400833955
    Vydavateľské údaje: Princeton, N.J. ; Woodstock Princeton University Press 2010
    “…To many outsiders, mathematicians appear to think like computers, grimly grinding away with a strict formal logic and moving methodically--even…”
    Získať plný text
    E-kniha Kniha
  7. 7

    Improved bounds on the randomized and quantum complexity of initial-value problems Autor Kacewicz, Bolesław

    ISSN: 0885-064X, 1090-2708
    Vydavateľské údaje: Elsevier Inc 01.10.2005
    Vydané v Journal of Complexity (01.10.2005)
    “… being a Hölder function with exponent ρ , the ɛ -complexity is shown to be O ( 1 / ɛ ) 1 / ( r + ρ + 1 / 3 ) in the randomized setting…”
    Získať plný text
    Journal Article
  8. 8

    On the complexity of training neural networks with continuous activation functions Autor DasGupta, B., Siegelmann, H.T., Sontag, E.

    ISSN: 1045-9227
    Vydavateľské údaje: New York, NY IEEE 01.11.1995
    Vydané v IEEE transactions on neural networks (01.11.1995)
    “… This is the first result on the hardness of loading a simple three-node architecture which does not consist of the binary-threshold neurons, but rather utilizes a particular continuous activation…”
    Získať plný text
    Journal Article
  9. 9

    Complexity of initial-value problems for ordinary differential equations of order k Autor Szczęsny, Marek

    ISSN: 0885-064X, 1090-2708
    Vydavateľské údaje: Elsevier Inc 01.08.2006
    Vydané v Journal of Complexity (01.08.2006)
    “…We study the worst-case ɛ -complexity of nonlinear initial-value problems u ( k ) ( x ) = g x , u ( x ) , u ′ ( x ) , … , u ( q ) ( x ) , x ∈ [ a , b ] , 0 ⩽ q < k , with given initial conditions…”
    Získať plný text
    Journal Article
  10. 10

    Fractional calculus: models and numerical methods. Autor Baleanu, Dumitru, Baleanu, Dumitru, Diethelm, Kai, Scalas, Enrico, Trujillo, Juan J

    ISBN: 9789814355209, 9814355208, 9814355216, 9789814355216
    Vydavateľské údaje: Hackensack, N.J World Scientific Publishing Co. Pte. Ltd 2012
    “… These operators have been used to model problems with anomalous dynamics, however, they also are an effective tool as filters and controllers, and they can be applied to write complicated functions…”
    Získať plný text
    E-kniha Kniha
  11. 11

    Index sets in computable analysis Autor Cenzer, Douglas, Remmel, Jeffrey B.

    ISSN: 0304-3975
    Vydavateľské údaje: 28.05.1999
    Vydané v Theoretical computer science (28.05.1999)
    Získať plný text
    Journal Article
  12. 12

    Average case complexity of linear multivariate problems Autor Woźniakowski, Henryk

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 01.07.1993
    Vydané v arXiv.org (01.07.1993)
    “…\) of all continuous linear functionals. Tractability of \(\lmp\) means that the average case complexity is \(O((1/\e)^p)\) with \(p\) independent of \(d…”
    Získať plný text
    Paper