Results 41 to 50 of about 4,793 (299)
Notes on Randomized Algorithms
CoRR, 2020 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 +2 more sources
RANDOMNESS, UNCERTAINTY, AND COGNITIVE FREEDOM IN THE DATA SOCIETY
Вісник Харківського національного університету імені В.Н. Каразіна. Серия: Теорія культури та філософіі наукиThe modern era of Big Data, in which massive volumes of information and predictive analytics serve as tools for forecasting human behavior, challenges the very notion of free will and personal autonomy.
Kostiantyn Suspitsyn
doaj +1 more source
On the power of randomization in on-line algorithms [PDF]
Algorithmica, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shai Ben-David +4 more
openaire +1 more source
Notions and applications of algorithmic randomness [PDF]
, 2013 Algorithmic randomness uses computability theory to define notions of randomness for infinite objects such as infinite binary sequences. The different possible definitions lead to a hierarchy of randomness notions. In this thesis we study this hierarchy,
Vermeeren, Stijn
core
FEBS Letters, EarlyView.The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson +6 more
wiley +1 more source
AN ALGORITHMIC INFORMATION THEORY CHALLENGE TO INTELLIGENT DESIGN
Zygon, 2014 William Dembski claims to have established a decision process to determine when highly unlikely events observed in the natural world are due to Intelligent Design.
doaj +2 more sources
A Randomized Algorithm for CCA
CoRR, 2014 We present RandomizedCCA, a randomized algorithm for computing canonical analysis, suitable for large datasets stored either out of core or on a distributed file system. Accurate results can be obtained in as few as two data passes, which is relevant for distributed processing frameworks in which iteration is expensive (e.g., Hadoop). The strategy also
Paul Mineiro, Nikos Karampatziakis
openaire +2 more sources
RANDOMIZED ALGORITHMS FOR MOTIF DETECTION [PDF]
Journal of Bioinformatics and Computational Biology, 2005 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
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
A Randomized Algorithm for 3-SAT [PDF]
Mathematics in Computer Science, 2010 In this work we propose and analyze a simple randomized algorithm to find a satisfiable assignment for a Boolean formula in conjunctive normal form (CNF) having at most 3 literals in every clause. Given a k-CNF formula phi on n variables, and alpha in{0,1}^n that satisfies phi, a clause of phi is critical if exactly one literal of that clause is ...
Subhas Kumar Ghosh, Janardan Misra
openaire +2 more sources