Results 31 to 40 of about 114,965 (266)
Regularization Total Least Squares and Randomized Algorithms
In order to achieve an effective approximation solution for solving discrete ill-conditioned problems, Golub, Hansen, and O’Leary used Tikhonov regularization and the total least squares (TRTLS) method, where the bidiagonal technique is considered to ...
Zhanshan Yang, Xilan Liu, Tiexiang Li
doaj +1 more source
Notes on Randomized Algorithms
Lecture notes for the Yale Computer Science course CPSC 4690/5690 Randomized Algorithms. Suitable for use as a supplementary text for an introductory graduate or advanced undergraduate course on randomized algorithms. Discusses tools from probability theory, including random variables and expectations, union bound arguments, concentration bounds ...
openaire +3 more sources
RANDOMIZED ALGORITHMS FOR MOTIF DETECTION [PDF]
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g. locating binding sites regulatory signals, designing genetic probes etc. In this paper, we propose a randomized algorithm, design an improved EM algorithm and combine them to form a software tool. Results: (1) We design a randomized algorithm for
Lusheng Wang 0001, Liang Dong
openaire +2 more sources
PAC–Bayes Guarantees for Data-Adaptive Pairwise Learning
We study the generalization properties of stochastic optimization methods under adaptive data sampling schemes, focusing on the setting of pairwise learning, which is central to tasks like ranking, metric learning, and AUC maximization.
Sijia Zhou, Yunwen Lei, Ata Kabán
doaj +1 more source
Randomized Algorithms for Computation of Tucker Decomposition and Higher Order SVD (HOSVD)
Big data analysis has become a crucial part of new emerging technologies such as the internet of things, cyber-physical analysis, deep learning, anomaly detection, etc.
Salman Ahmadi-Asl +6 more
doaj +1 more source
Randomized Competitive Analysis for Two Server Problems
We prove that there exists a randomized online algorithm for the 2-server 3-point problem whose expected competitive ratio is at most 1.5897. This is the first nontrivial upper bound for randomized k-server algorithms in a general metric space whose ...
Jun Kawahara, Kazuo Iwama, Wolfgang Bein
doaj +1 more source
Quantum online algorithms for a model of the request-answer game with a buffer
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
Machine learning algorithms to identify cluster randomized trials from MEDLINE and EMBASE
Background Cluster randomized trials (CRTs) are becoming an increasingly important design. However, authors of CRTs do not always adhere to requirements to explicitly identify the design as cluster randomized in titles and abstracts, making retrieval ...
Ahmed A. Al-Jaishi +7 more
doaj +1 more source
ABSTRACT Background Japan has one of the highest dialysis prevalence rates worldwide and a shrinking, aging population. Whether dialysis burden has entered a sustained post‐peak phase or whether recent declines partly reflect pandemic‐related disruptions remains uncertain.
Hatice Şahin +2 more
wiley +1 more source
Randomized Compiling for Scalable Quantum Computing on a Noisy Superconducting Quantum Processor
The successful implementation of algorithms on quantum processors relies on the accurate control of quantum bits (qubits) to perform logic gate operations.
Akel Hashim +13 more
doaj +1 more source

