Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 12712 for “"randomized"”.
-
Optimal randomized and non-randomized procedures for multinomial selection problems
… optimal procedure turns out to be necessarily randomized in many cases. We also find via mixed integer programming the optimal non-randomized procedure. We demonstrate the performance of the methodology on a number of examples. We then reformulate the mathematical programs to make them more …
-
Randomized Zero Forcing
… of iterations. Probabilistic zero forcing and randomized zero forcing are variations of zero forcing where the iterative color changing rule is no longer deterministic but rather probabilistic. One desired quantity in probabilistic and randomized zero forcing would be the expected propagation …
-
Synthesizing randomized and non-randomized studies of interventions in meta-analysis models
Randomized controlled trials (RCTs) are considered the gold standard for evaluating the effectiveness of interventions, because randomization reduces confounding and ensures strong internal validity. However, in many areas the available RCT evidence is limited because trials often include selected …
-
Extensions of Randomized Benchmarking
… process, but also the structure of the noise. Randomized benchmarking is a characterization protocol which extracts partial information from a noisy quantum process. This thesis gives a detailed review of the randomized benchmarking protocol, and presents the results of three collaborative …
-
The randomized server problem
… and Reischuk. (3) We give optimally competitive randomized algorithms for 2 and 3 cache paging with few bookmarks. We note that the paging problem is a special case of the server problem, and that it is desirable to minimize the number of bookmarks, as such bookmarks pose a considerable challenge …
-
The Role of Randomized and Non-Randomized Studies in Knowledge Synthesis of Health Interventions.
Randomized studies (RS) are considered the best source of evidence for knowledge syntheses (e.g., systematic reviews, health technology assessments, health guidelines, among others) about healthcare interventions. Historically, non-randomized studies (NRS) have been usually discarded from knowledge …
-
Randomized distributed computing on rings
The communication complexity of fundamental problems in distributed computing on an asynchronous ring are examined from both the algorithmic and lower bound perspective. A detailed study is made of the effect on complexity of a number of assumptions about the algorithms. Randomization is shown to …
-
A uniform randomized routing algorithm.
… using it. We analyze traffic load for some randomized local routing algorithms, some of which assume geometric information on the network. We also propose a uniform randomized routing algorithm generating uniform distributed routes between a pair of sites where only source, destination and …
-
Subspace learning by randomized sketching
High dimensional data is often accompanied by inherent low dimensionality that can be leveraged to design scalable machine learning and signal processing algorithms. Developing efficient computational frameworks that take advantage of the underlying structure in the data is crucial. In this thesis, …
-
Analysis of randomized security protocols
Made available in DSpace on 2019-02-06T19:36:23Z (GMT). No. of bitstreams: 2 BAUER-DISSERTATION-2018.pdf: 942833 bytes, checksum: 783bd3a1adfd3dfd54474a5046e90152 (MD5) LICENSE.txt: 4210 bytes, checksum: 9c379298174d05b023e864fcc4653dd4 (MD5) Previous issue date: 2018-11-30
-
An Empirical Study of Bias in Randomized Controlled Trials and Non-randomized Studies of Surgical Interventions
… aim of this dissertation was to examine bias in randomized controlled trials (RCTs) and non-randomized studies (NRS) in surgery using the literature evaluating laparoscopy and conventional (i.e. open) surgery for the treatment of colon cancer as a case study. The objectives were 1) to develop a …
-
Randomized dimension reduction with statistical guarantees
… perspective, we design and analyze fast randomized low-rank decomposition algorithms for large matrices based on “matrix sketching”, which can be regarded as a dimension reduction strategy in the data space. These include the randomized pivoting-based interpolative and CUR decomposition …
-
Randomized Algorithms for Mega-AI Models
Over the past few years, we have witnessed remarkable accomplishments in machine learning (ML) models due to increases in their sizes. However, the growth in model size has outpaced upgrades to hardware and network bandwidth, resulting in difficulties in training these Mega-AI models within current …
-
Statistical inference with randomized nomination sampling
… new inference procedures that are based on randomized nomination sampling (RNS). The first problem we consider is that of constructing distribution-free confidence intervals for quantiles for finite populations. The required algorithms for computing coverage probabilities of the proposed …
-
New Results on Randomized Matrix Computations
… aim of this thesis is to present new results in randomized matrix computations. Specifically, and ultimately, we show how to modify, or preprocess an ill conditioned matrix having small numerical nullity (co-rank) into a nonsingular well conditioned matrix. This has intrinsic theoretical interest …
-
Randomized ensemble methods for classification trees
We propose two methods of constructing ensembles of classifiers. One method directly injects randomness into classification tree algorithms by choosing a split randomly at each node with probabilities proportional to the measure of goodness for a split. We combine this method with a stopping rule …
Page 1 of 636