Results 41 to 50 of about 9,831,579 (305)
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
Machine learning algorithms to identify cluster randomized trials from MEDLINE and EMBASE
Systematic Reviews, 2022 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
Randomized Competitive Analysis for Two Server Problems
Algorithms, 2008 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
Randomized Compiling for Scalable Quantum Computing on a Noisy Superconducting Quantum Processor
Physical Review X, 2021 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
Cryptography and Algorithmic Randomness [PDF]
Theory of Computing Systems, 2014 34 pages, LaTeX2e, no ...
Tadaki, Kohtaro, Doi, Norihisa
openaire +2 more sources
Faster Randomized Block Kaczmarz Algorithms [PDF]
SIAM Journal on Matrix Analysis and Applications, 2019 The Kaczmarz algorithm is a simple iterative scheme for solving consistent linear systems. At each step, the method projects the current iterate onto the solution space of a single constraint.
Ion Necoara
semanticscholar +1 more source
Random forest missing data algorithms [PDF]
Statistical Analysis and Data Mining: The ASA Data Science Journal, 2017 Random forest (RF) missing data algorithms are an attractive approach for imputing missing data. They have the desirable properties of being able to handle mixed types of missing data, they are adaptive to interactions and nonlinearity, and they have the potential to scale to big data settings.
Tang, Fei, Ishwaran, Hemant
openaire +4 more sources
Molecular Oncology, EarlyView.Detection of extrachromosomal circular DNA (eccDNA) in plasma samples from EGFR‐mutated non‐small cell lung cancer patients. Plasma was collected before and during treatment with the EGFR‐tyrosine kinase inhibitor osimertinib. Plasma eccDNA was detected in all cancer samples, and the presence of the EGFR gene on eccDNA serves as a potential biomarker ...
Simone Stensgaard +5 more
wiley +1 more source
International Journal of Applied Mathematics and Computer Science, 2012 It was conjectured by Fan and Raspaud (1994) that every bridgeless cubic graph contains three perfect matchings such that every edge belongs to at most two of them.
Formanowicz Piotr, Tanaś Krzysztof
doaj +1 more source
COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS [PDF]
The Journal of Symbolic Logic, 2016 AbstractA coarse description of a set A ⊆ ω is a set D ⊆ ω such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse descriptions of a given set A, especially when A is effectively random in some sense.
Hirschfeldt, Denis R. +3 more
openaire +2 more sources