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 46 for “"Probabilistic algorithms"”.

  1. Probabilistic algorithms for transition altitude optimization in ballistic airdrop

    The development of a transition altitude optimization algorithm for ballistic airdrops is detailed. Ballistic airdrops are unguided, high-altitude, low-opening cargo drops for military or humanitarian purposes. Compared to their guided airdrop counterparts, unguided airdrops are cheaper but have …

    gatech Repository record for Probabilistic algorithms for transition altitude optimization in ballistic airdrop (opens in a new tab)

  2. Parallelizing Probabilistic Algorithms for Centrality Measures and Graph Partitioning on Large Graphs

    … continues to grow, serial computation of graph algorithms has become prohibitively expensive, prompting researchers to seek parallel solutions to common network analysis problems. However, the imbalanced workload and irregular data access patterns inherent to graph algorithms present a unique …

    texas-state Repository record for Parallelizing Probabilistic Algorithms for Centrality Measures and Graph Partitioning on Large Graphs (opens in a new tab)

  3. Accelerating Data Parallel Applications via Hardware and Software Techniques

    … in various domains. These methods include probabilistic algorithms, such as Markov Chain Monte-Carlo (MCMC), which rely on generating random numbers from probability distributions. These algorithms are computationally expensive on conventional processors, yet their statistical properties, …

    duke Repository record for Accelerating Data Parallel Applications via Hardware and Software Techniques (opens in a new tab)

  4. Decomposition of Finite-Dimensional Matrix Algebras over \mathbb{F}_{q}(y)

    … the computational complexity and exhibit new algorithms for this problem over the field \mathbb{F}_{q}(y), where \mathbb{F}_{q} is the finite field with q elements. In this thesis we will present new efficient probabilistic algorithms for Wedderburn decomposition and the computation of the …

    waterloo Repository record for Decomposition of Finite-Dimensional Matrix Algebras over \mathbb{F}_{q}(y) (opens in a new tab)

  5. Efficient Probabilistic Pricing Algorithms for Multiple Exercise Options

    This thesis presents efficient probabilistic algorithms for the pricing of multiple exercise options. The algorithms handle the large class of of constrained multiple exercise American options. Two algorithms are presented. Single Pass Lookahead Search provides a lower estimate of an option price, …

    concordia Download PDF for Efficient Probabilistic Pricing Algorithms for Multiple Exercise Options (opens in a new tab)

  6. Effect of Imbalanced Data on Document Classification Algorithms

    … In spite of this, various categorization algorithms have reached accuracies in the vicinity of 90%. It has generally been found that probability based algorithms perform better on Natural Language Processing tasks compared to other types of algorithms. This is in addition to probabilistic …

    auckland-tech Repository record for Effect of Imbalanced Data on Document Classification Algorithms (opens in a new tab)

  7. Elastic Parameter Memory for Efficient Machine Learning

    … which repurposes traditionally data-consuming probabilistic algorithms and data structures to the setting of learning where we learn compact representations of ML models. EM is an example of the confluence of probabilistic algorithms and data structures and ML, which opens up new research areas …

    rice Repository record for Elastic Parameter Memory for Efficient Machine Learning (opens in a new tab)

  8. Pseudorandom generators and structural complexity

    … hierarchy, the randomization in bounded-error probabilistic algorithms is interchangeable with that in random oracles. The proof of this theorem, essentially due to Nisan and Wigderson, provides new methods and results for using pseudorandom generators in solving problems in structural …

    iastate Repository record for Pseudorandom generators and structural complexity (opens in a new tab)

  9. A Molecular-scale Programmable Stochastic Process Based On Resonance Energy Transfer Networks: Modeling And Applications

    … units (RSU) can be constructed to accelerate probabilistic algorithms for wide applications in machine learning and data analytics. Because probabilistic algorithms often rely on iteratively sampling from parameterized distributions, they can be inefficient in practice on the deterministic …

    duke Repository record for A Molecular-scale Programmable Stochastic Process Based On Resonance Energy Transfer Networks: Modeling And Applications (opens in a new tab)

  10. Integrating data systems to improve HIV care engagement in King County, WA

    … also consider the accuracy of the record linkage algorithms they utilize, in order to maximize their reach and efficiency. We investigated the effect of the use of real-time data exchange on HIV care engagement outcomes in two settings: emergency department and inpatient hospitals and in jails. …

    washington Repository record for Integrating data systems to improve HIV care engagement in King County, WA (opens in a new tab)

  11. Lifted First-Order Probabilistic Inference

    … division in AI between logical symbolic and probabilistic reasoning approaches. While probabilistic models can deal well with inherent uncertainty in many real-world domains, they operate on a mostly propositional level. Logic systems, on the other hand, can deal with much richer …

    uiuc Repository record for Lifted First-Order Probabilistic Inference (opens in a new tab)

  12. Power mode scheduling for ad hoc network routing

    … In the second part of this work, I propose two probabilistic algorithms for scheduling transition from idle mode to sleep mode. Performance evaluation of these strategies shows significant reduction in power usage, with only a slight decrease in performance.

    rice Repository record for Power mode scheduling for ad hoc network routing (opens in a new tab)

  13. Planetary Micro-Rovers with Bayesian Autonomy

    … software, and novel implementations of probabilistic algorithms, we have obtained a comprehensive set of hardware and software designs that can form the basis for many kinds of intelligent but low-cost robots. A lightweight tubular chassis that can be simply deployed protects sensors, …

    york Repository record for Planetary Micro-Rovers with Bayesian Autonomy (opens in a new tab)

  14. Probabilistic dynamic cable rating algorithms

    … research was focused on the development of probabilistic algorithms for the hours ahead estimation of future load currents, cable temperatures and estimation of likely risk of cable overheating. The proposed algorithms are based on a limited amount of historical offshore data which is …

    soton Download PDF for Probabilistic dynamic cable rating algorithms (opens in a new tab)

  15. Dimension reduction of streaming data via random projections

    … communities have developed randomised, probabilistic algorithms to estimate statistics of interest over streaming data on the fly, with small computational complexity and storage requirements, by constructing low dimensional representations of the stream known as data sketches. This …

    oxford Repository record for Dimension reduction of streaming data via random projections (opens in a new tab)

  16. Sample-based Probabilistic Estimation for Indoor Positioning and Tracking Under Ranging Uncertainty

    … uncertainty, which typically resorts to the probabilistic perspective. Since there is no analytical solution to the nonlinear and non-Gaussian positioning problem, the research trends have moved towards exploring sample-based approximations in the probabilistic frame. However, the …

    fu-berlin Repository record for Sample-based Probabilistic Estimation for Indoor Positioning and Tracking Under Ranging Uncertainty (opens in a new tab)

  17. Properties of graphs with large girth

    … devoted to the analysis of a class of iterative probabilistic algorithms in regular graphs, called locally greedy algorithms, which will provide bounds for graph functions in regular graphs with large girth. This class is useful because, by conveniently setting the parameters associated with it, …

    waterloo Repository record for Properties of graphs with large girth (opens in a new tab)

  18. 2.5D Chiplet Architecture for Embedded Processing of High Velocity Streaming Data

    … 2.5D chiplet-based architecture for real-time probabilistic processing of high-velocity sensor data, from an autonomous real-time ubiquitous surveillance imaging system. This work addresses problems at all levels of description. At the lowest physical level, new standard cell libraries have …

    jhu Repository record for 2.5D Chiplet Architecture for Embedded Processing of High Velocity Streaming Data (opens in a new tab)

  19. Solving the Communication Channel Association Problem for Mobile Robots

    … We present two deterministic and one probabilistic algorithm which solve the association problem for stationary robots. Furthermore, we introduce modifications to the probabilistic algorithm in order to tackle the harder, mobile robot version of the problem where robot motion results …

    tamu Repository record for Solving the Communication Channel Association Problem for Mobile Robots (opens in a new tab)

Page 1 of 3