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 121 for “"Sampling algorithms"”.
-
Sampling Algorithms for Evolving Datasets
… Most of the existing work on database sampling focuses on how to create or exploit a random sample of a static database, that is, a database that does not change over time. The assumption of a static database, however, severely limits the applicability of these techniques in practice, …
-
Non-uniform sampling: algorithms and architectures
… classic signal processing: the Shannon-Nyquist sampling theorem which stated that when sampled uniformly, there is no way to increase the upper frequency in the signal spectrum and still unambiguously represent the signal except by raising the sampling rate. This thesis is dedicated to the …
-
Scaling Up Robotics-Inspired Conformational Sampling Algorithms
… a protein may interact with different partners. Algorithms from sampling-based robot motion planning have been used for conformational sampling of small-sized systems. These algorithms keep track of “coverage” in conformational space based on what has been sampled and aim to intelligently perturb …
-
Robust and Scalable Sampling Algorithms for Network Measurement
… proposing a novel mechanism called residual sampling, which intentionally introduces a predetermined amount of bias into the measurement process. We show that such biased sampling can be extremely scalable; moreover, we develop residual estimation algorithms that can unbiasedly recover the …
-
DSMC multicomponent aerosol dynamics : sampling algorithms and aerosol processes
… the evolution of nuclear aerosols. Several sampling algorithms and aerosol processes such as coagulation, deposition, condensation, and source reinforcement are explored for a multi-component, aerosol dynamics problem in a spatially homogeneous medium. Several test problems are simulated …
-
ON SCALABLE AND FAST LANGEVIN-DYNAMICS-BASED SAMPLING ALGORITHMS
Langevin dynamics-based sampling algorithms are arguably among the most widelyused Markov Chain Monte Carlo (MCMC) methods. Two main directions of the modern study of MCMC methods are (i) How to scale MCMC methods to big data applications, and (ii) Tight convergence analysis of MCMC algorithms, …
-
The effects of bias on sampling algorithms and combinatorial objects
Markov chains are algorithms that can provide critical information from exponentially large sets efficiently through random sampling. These algorithms are ubiquitous across numerous scientific and engineering disciplines, including statistical physics, biology and operations research. In this …
-
Efficient texture representation and sampling algorithms for real-time rendering
… graphics, the goal of photorealistic rendering algorithms is to create convincing images given the description of a scene. However, photorealistic image generation is still an elusive goal for real-time rendering, where the final image should be synthesized in a small fraction of a second. In …
-
Applying Statistical Mechanics to Improve Computational Sampling Algorithms and Interatomic Potentials
… maximization framework and propose an automated sampling scheme to sample from this objective function. We show that this approach generates much more diverse training sets than unbiased sampling and is competitive with hand-crafted training sets[1].
-
Decision theory and sampling algorithms for spatial and spatio-temporal point processes
… is used. We exemplified the proposed estimators, sampling algorithm and point process model through simulations and applications to the Chicago crime data, the Swedish pines data and the United States natural caused wildfire data from 2002 to 2019.
-
New Variational and Sampling Algorithms for Large-scale Bayesian Model Selection Problems
… spaces, informed Markov chain Monte Carlo (MCMC) algorithms have been proposed as scalable methods for Bayesian posterior calculation. Informed Importance Tempering (IIT), a recently introduced category of Markov chain Monte Carlo techniques, combines importance sampling and informed local …
-
Probabilistic techniques for analyzing sampling algorithms and the dynamics of lattice models
… various constraints. Markov chain Monte Carlo algorithms are often used to sample from distributions over the exponentially large state space of these models to gain insight about the system and estimate its thermodynamic properties. Similar problems arise throughout machine learning, …
-
Distributed reservoir sampling algorithms for data pre-processing with use of Kafka Streams
Με την ανάπτυξη του IoT και με τον αριθμό των συσκευών που αναμένεται να συνδεθούν σε αυτό να ξεπερνάει τα 30 δισεκατομμύρια μέχρι το 2020 καθώς και με την συνεπακόλουθη αύξηση στα δεδομένα που μεταδίδονται κρίνεται αναγκαίο από τα σύγχρονα συστήματα επεξεργασίας δεδομένων μεγάλης κλίμακας να …
-
Conformational enhanced sampling the study and development of accelerated sampling algorithms for classical biomolecular dynamics
… hardware and innovations within enhanced sampling methods has led to the ability to study larger and more complex biomolecular systems and problems that rely upon simulating a larger number of slow degrees of freedom that may also be orthogonal to one another. Despite this progress, there …
-
Efficient Sampling Using Markov Chain Monte Carlo Methods
This thesis explores the challenge of efficient sampling from target distributions, a problem at the heart of statistics, machine learning, and theoretical computer science with applications in Bayesian estimation, volume computation, and bandit optimization. The focus is on designing optimal …
-
Mean-Variance mixture model for calibrating loss given default (LGD) of a credit portfolio
… loss rate. We also propose two importance sampling algorithms for finding conditional tail probabilities for the portfolio loss. Our approach is unique in two aspects. First, we capture the dependence between default and LGD. Second, we make LGD values to be random and between zero and one. …
-
Meta-learning Performance Prediction of Highly Configurable Systems: A Cost-oriented Approach
… effort. In this work, we adapt two widely-used sampling strategies for performance prediction to the domain of configurable systems and evaluate them in terms of sampling cost, which considers prediction accuracy and measurement effort simultaneously. To generate an initial sample, we develop two …
-
Application of SPSA-Type Algorithms in High-dimensional Stochastic Optimization and Sampling
… the SPSA-type approximation in gradient-based sampling algorithms, e.g. Langevin Monte Carlo (LMC).
Page 1 of 7