GitHub

asymptotic-notation.md

Asymptotic Notations are languages that allow us to analyze an algorithm's running time by identifying its behavior as the input size for the algorithm increases. This is also known as an algorithm's ...
GitHub

asymptotic_notation_time_complexity.py

Asymptotic notation is a way of describing the efficiency of algorithms in terms of their input size. The most common asymptotic notations are: Big O (O): Describes an upper bound, representing the ...
JSTOR Daily

Gaussian Asymptotic Limits for the α-transformation in the Analysis of Compositional Data

Sankhyā: The Indian Journal of Statistics, Series A (2008-), Vol. 81, No. 1, Special issue Statistics on non-Euclidean Spaces and Manifolds (February 2019), pp. 63-82 (20 pages) Compositional data ...
JSTOR Daily

Asymptotic Properties of M-Estimators Based on Estimating Equations and Censored Data

Scandinavian Journal of Statistics, Vol. 26, No. 2 (Jun., 1999), pp. 297-318 (22 pages) Properties of Huber's M-estimators based on estimating equations have been studied extensively and are well ...
IEEE

Data-Based Adaptive Asymptotic Tracking Control for High-Speed Train: A Feedback Linearization Approach

Abstract: This paper presents a novel data-based adaptive control strategy based on feedback linearization to address the asymptotic tracking control problem of position and speed for underactuated ...