Search Results - e-complexity of continuous functions

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

“…). 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…”
Get full text

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

“…We consider a retrospective segmentation and classification problem for GARCH models. Segmentation is the partition of a long time series into homogeneous…”
Get full text

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

“… The book presents a broad set of tools for understanding coordination algorithms, determining their correctness, and assessing their complexity…”
Get full text

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

“… 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…”
Get full text

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

“… being a Hölder function with exponent ρ , the ɛ -complexity is shown to be O ( 1 / ɛ ) 1 / ( r + ρ + 1 / 3 ) in the randomized setting…”
Get full text

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

“…The results established in this book constitute a new departure in ergodic theory and a significant expansion of its scope. Traditional ergodic theorems…”
Get full text

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

“… 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…”
Get full text

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

“…To many outsiders, mathematicians appear to think like computers, grimly grinding away with a strict formal logic and moving methodically--even…”
Get full text

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

“…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…”
Get full text

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

“… 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…”
Get full text

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

Get full text

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

“…\) of all continuous linear functionals. Tractability of \(\lmp\) means that the average case complexity is \(O((1/\e)^p)\) with \(p\) independent of \(d…”
Get full text