Results 11 to 20 of about 314,651 (266)
Quantum and Classical Log-Bounded Automata for the Online Disjointness Problem
Mathematics, 2022 We consider online algorithms with respect to the competitive ratio. In this paper, we explore one-way automata as a model for online algorithms. We focus on quantum and classical online algorithms. For a specially constructed online minimization problem,
Kamil Khadiev, Aliya Khadieva
doaj +1 more source
Online Regularized Classification Algorithms [PDF]
IEEE Transactions on Information Theory, 2006 Summary: This paper considers online classification learning algorithms based on regularization schemes in reproducing kernel Hilbert spaces associated with general convex loss functions. A novel capacity independent approach is presented. It verifies the strong convergence of the algorithm under a very weak assumption of the step sizes and yields ...
Yiming Ying, Ding-Xuan Zhou
openaire +1 more source
An Efficient Online Cache Replacement Algorithm for 5G Networks
IEEE Access, 2018 In recent years, 5G cellular networks utilization has rapidly increased and is expected to grow even more in the near future. This will put the current cellular networks operators in a challenge to overcome the network's limits to satisfy the increasing ...
Ammar Gharaibeh +2 more
doaj +1 more source
Online Portfolio Selection Based on Follow-the-Loser Algorithms [PDF]
تحقیقات مالی, 2020 Objective: Nowadays, the volume and speed of transactions in financial markets have grown dramatically and it is hard to track market changes by using traditional methods.
Javad Validi +2 more
doaj +1 more source
International Journal of Neural Systems, 2008 We introduce a set of clustering algorithms whose performance function is such that the algorithms overcome one of the weaknesses of K-means, its sensitivity to initial conditions which leads it to converge to a local optimum rather than the global optimum.
Barbakh, Wesam, Fyfe, Colin
openaire +3 more sources
Online Uniformly Inserting Points on the Sphere
Algorithms, 2018 Uniformly inserting points on the sphere has been found useful in many scientific and engineering fields. Different from the offline version where the number of points is known in advance, we consider the online version of this problem.
Rong Zhou +5 more
doaj +1 more source
Quantum online algorithms for a model of the request-answer game with a buffer
Учёные записки Казанского университета: Серия Физико-математические науки, 2020 In this paper, we considered online algorithms as a request-answer game between two players: an adversary that generates input requests and an online algorithm that answers them.
K.R. Khadiev, D.I. Lin
doaj +1 more source
An Online Minorization-Maximization Algorithm
, 2023 AbstractModern statistical and machine learning settings often involve high data volume and data streaming, which require the development of online estimation algorithms. The online Expectation–Maximization (EM) algorithm extends the popular EM algorithm to this setting, via a stochastic approximation approach.We show that an online version of the ...
Nguyen, Hien +3 more
openaire +2 more sources
Online Algorithm Selection [PDF]
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017 Algorithm selection approaches have achieved impressive performance improvements in many areas of AI. Most of the literature considers the offline algorithm selection problem, where the initial selection model is never updated after training. However, new data from running algorithms on instances becomes available while an algorithm selection method is
openaire +1 more source
Sequential Change-Point Detection via Online Convex Optimization
Entropy, 2018 Sequential change-point detection when the distribution parameters are unknown is a fundamental problem in statistics and machine learning. When the post-change parameters are unknown, we consider a set of detection procedures based on sequential ...
Yang Cao, Liyan Xie, Yao Xie, Huan Xu
doaj +1 more source