Suchergebnisse - e-complexity of continuous functions

  • Treffer 1 - 12 von 12
Treffer weiter einschränken
  1. 1

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

    ISSN: 0747-4946, 1532-4176
    Veröffentlicht: Philadelphia Taylor & Francis Ltd 01.04.2014
    Veröffentlicht in 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 …”
    Volltext
    Journal Article
  2. 2

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

    ISSN: 2769-2140, 2769-2140
    Veröffentlicht: AIMS Press 01.09.2022
    Veröffentlicht in 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 …”
    Volltext
    Journal Article
  3. 3

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

    ISBN: 9780691141954, 0691141959, 0691146640, 9780691146645, 1400831474, 9781400831470
    Veröffentlicht: 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 …”
    Volltext
    E-Book Buch
  4. 4

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

    ISBN: 9780691091921, 0691091927, 0691091935, 9780691091938, 9781400825134, 140082513X
    Veröffentlicht: 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 …”
    Volltext
    E-Book Buch
  5. 5

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

    ISBN: 9780691141855, 1400831067, 9781400831067, 0691141843, 9780691141848, 0691141851
    Veröffentlicht: 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 …”
    Volltext
    E-Book Buch
  6. 6

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

    ISBN: 0691127387, 9780691145990, 9780691127385, 0691145997, 1400833957, 9781400833955
    Veröffentlicht: 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 …”
    Volltext
    E-Book Buch
  7. 7

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

    ISSN: 0885-064X, 1090-2708
    Veröffentlicht: Elsevier Inc 01.10.2005
    Veröffentlicht in 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 …”
    Volltext
    Journal Article
  8. 8

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

    ISSN: 1045-9227
    Veröffentlicht: New York, NY IEEE 01.11.1995
    Veröffentlicht in 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 …”
    Volltext
    Journal Article
  9. 9

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

    ISSN: 0885-064X, 1090-2708
    Veröffentlicht: Elsevier Inc 01.08.2006
    Veröffentlicht in 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 …”
    Volltext
    Journal Article
  10. 10

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

    ISBN: 9789814355209, 9814355208, 9814355216, 9789814355216
    Veröffentlicht: 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 …”
    Volltext
    E-Book Buch
  11. 11

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

    ISSN: 0304-3975
    Veröffentlicht: 28.05.1999
    Veröffentlicht in Theoretical computer science (28.05.1999)
    Volltext
    Journal Article
  12. 12

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

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 01.07.1993
    Veröffentlicht in 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 …”
    Volltext
    Paper