Results 51 to 60 of about 10,143,058 (320)
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
Regularization Total Least Squares and Randomized Algorithms
MathematicsIn 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
On the Complexity of Asynchronous Agreement Against Powerful Adversaries
, 2013 We introduce new techniques for proving lower bounds on the running time of randomized algorithms for asynchronous agreement against powerful adversaries. In particular, we define a \emph{strongly adaptive adversary} that is computationally unbounded and
Lewko, Allison, Lewko, Mark
core +1 more source
Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons [PDF]
, 2010 We study sorting algorithms based on randomized round-robin comparisons. Specifically, we study Spin-the-bottle sort, where comparisons are unrestricted, and Annealing sort, where comparisons are restricted to a distance bounded by a \emph{temperature ...
Goodrich, Michael T.
core +2 more sources
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms
Journal of the ACM, 2018 This article presents a wp--style calculus for obtaining bounds on the expected runtime of randomized algorithms. Its application includes determining the (possibly infinite) expected termination time of a randomized algorithm and proving positive almost-
Benjamin Lucien Kaminski +3 more
semanticscholar +1 more source
Better algorithms for unfair metrical task systems and applications [PDF]
, 2003 Unfair metrical task systems are a generalization of online metrical task systems. In this paper we introduce new techniques to combine algorithms for unfair metrical task systems and apply these techniques to obtain improved randomized online algorithms
Fiat, Amos, Mendel, Manor
core +1 more source
PAC–Bayes Guarantees for Data-Adaptive Pairwise Learning
EntropyWe 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
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
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
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