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 109 for “"greedy algorithms"”.

  1. Greedy Algorithms and Incoherent Systems

    … best upper bound on the rate of convergence of greedy expansions, and explicit formulas for approximants from the Pure Greedy Algorithm.

    south-carolina Repository record for Greedy Algorithms and Incoherent Systems (opens in a new tab)

  2. Deterministic Greedy Algorithms for Optimal Sensor Placement

    … any typical network, it has been proven that a greedy placement algorithm achieves a minimum of 63% optimal reduction in total variance. The focus in this paper is on sensor-optimization problem with the help of two approximation algorithms inherited from traditional greedy approach with …

    ndsu Repository record for Deterministic Greedy Algorithms for Optimal Sensor Placement (opens in a new tab)

  3. Greedy Algorithms In Approximation Theory and Compressed Sensing

    … consideration is how to construct good methods (algorithms) of approximation, and how to measure the performance of these methods. One of the most successful approaches in this area is the greedy method, which belongs to the theory of nonlinear approximation. This dissertation answers the …

    south-carolina Repository record for Greedy Algorithms In Approximation Theory and Compressed Sensing (opens in a new tab)

  4. Greedy algorithms for physics-informed sparse sensor selection

    … usually based on convex relaxations or greedy algorithms. This text focuses on a well-known greedy algorithm, the column-pivoted QR decomposition, which is performed on basis modes from a low-rank decomposition of the system, to pick out sensor locations that are approximately maximally …

    washington Repository record for Greedy algorithms for physics-informed sparse sensor selection (opens in a new tab)

  5. New perspectives and applications for greedy algorithms in machine learning

    … With this goal in mind, we develop greedy algorithm variants and study their theoretical properties by establishing novel connections of the resulting optimization problems in parsimonious VI with traditional studies in the discrete optimization literature. Specific realizations lead …

    texas Repository record for New perspectives and applications for greedy algorithms in machine learning (opens in a new tab)

  6. NEAR-OPTIMALITY AND ROBUSTNESS OF GREEDY ALGORITHMS FOR BAYESIAN POOL-BASED ACTIVE LEARNING

    … To facilitate the analyses of active learning algorithms in this setting, we develop two powerful theoretical tools: (1) an equivalence between probabilistic hypothesis spaces and deterministic hypothesis spaces, and (2) a near-optimality guarantee for greedy algorithms when maximizing …

    nus Repository record for NEAR-OPTIMALITY AND ROBUSTNESS OF GREEDY ALGORITHMS FOR BAYESIAN POOL-BASED ACTIVE LEARNING (opens in a new tab) Download file for NEAR-OPTIMALITY AND ROBUSTNESS OF GREEDY ALGORITHMS FOR BAYESIAN POOL-BASED ACTIVE LEARNING (opens in a new tab)

  7. Prediction in High-Dimensional Statistical Modelling Using Greedy Algorithms and Information Theoretic Criteria

    … (sparse model). It has been shown that the greedy algorithms e ciently generate models in the HD case as well as in the big data (BD) case (n pn). We discuss the use of the following greedy algorithms: Matching Pursuit Algorithm (MPA), Orthogonal Matching Pursuit (OMP), Relaxed Matching …

    auckland-ms Repository record for Prediction in High-Dimensional Statistical Modelling Using Greedy Algorithms and Information Theoretic Criteria (opens in a new tab)

  8. Generalizing Contexts Amenable to Greedy and Greedy-like Algorithms

    … One particularly interesting paradigm is the greedy algorithm paradigm. Informally, a greedy algorithm builds a solution to a problem incrementally by making locally optimal decisions at each step. Greedy algorithms are important in algorithm design as they are natural, conceptually simple to …

    toronto-retro Repository record for Generalizing Contexts Amenable to Greedy and Greedy-like Algorithms (opens in a new tab)

  9. Deterministic simulation of multi-beaded models of dilute polymer solutions

    … connection of the approximation method with the greedy algorithms from nonlinear approximation theory explored, for example, by DeVore and Temlyakov (Adv. Comput. Math. 5:173--187, 1996). We extend the convergence analysis of the pure greedy and orthogonal greedy algorithms considered by Le~Bris, …

    oxford Repository record for Deterministic simulation of multi-beaded models of dilute polymer solutions (opens in a new tab)

  10. Greedy Matching Algorithms in Semi-Streaming Environments for Large Bipartite Graphs

    … to the high memory and time demands of optimal algorithms. This thesis investigates the viability of greedy matching algorithms within a semi-streaming environment as a practical approach for such scenarios. Several variations of greedy algorithms, including the ℓ-Local Greedy and the ℓ-Local …

    chalmers Repository record for Greedy Matching Algorithms in Semi-Streaming Environments for Large Bipartite Graphs (opens in a new tab)

  11. In pursuit of high resolution radar using pursuit algorithms

    … solution. In this thesis, we focus on the greedy algorithm approach to solve the problem and show that it naturally yields a quantitative measure for radar resolution. In addition, we show that the limitations of the greedy algorithms can be attributed to the close relation between greedy …

    purdue-thes Repository record for In pursuit of high resolution radar using pursuit algorithms (opens in a new tab)

  12. Investigation of effect of different run-time distributions on SmartNet performance

    … Assignment (LBA) Algorithm, an O(mn squared) Greedy Algorithm, and an O(mn) Greedy Algorithm. SmartNet is a framework for scheduling jobs and machines in a heterogeneous computing environment. Its major strength is its use of both current machine loads and predicted job/machine performance …

    nps Repository record for Investigation of effect of different run-time distributions on SmartNet performance (opens in a new tab)

  13. Additive Lebesgue-Type Inequalities for Greedy Approximation

    … and focus on a class of such techniques called "greedy algorithms". A problem that we will be mostly concerned with is of measuring performance of these algorithms (specifically, Pure Greedy Algorithm and Orthogonal Greedy Algorithm). We will compare several ways to describe the quality of the …

    south-carolina Repository record for Additive Lebesgue-Type Inequalities for Greedy Approximation (opens in a new tab)

  14. Greedy Inference Algorithms for Structured and Neural Models

    … optimal solution extremely expensive. Thus, greedy algorithms, making trade-offs between precision and efficiency, are widely used. Unfortunately, they in general lack theoretical guarantees. In this thesis, we prove that greedy algorithms are effective and efficient to search for multiple …

    vt Repository record for Greedy Inference Algorithms for Structured and Neural Models (opens in a new tab)

  15. A Survey of Monge Properties

    … role in theoretical computer science. Many greedy algorithms are based on such properties, as is speedup in dynamic programming. Monge properties are simple monotonicity properties which are observed and used in various settings such as resource optimization, computational geometry, …

    unlv Repository record for A Survey of Monge Properties (opens in a new tab) Download PDF for A Survey of Monge Properties (opens in a new tab)

  16. Machine Learning for Designing Fast Quantum Gates

    … scheme, is called a policy. Machine learning algorithms can be employed to find successful policies for designing quantum gates. In particular, we employ supervised machine learning techniques to generate these successful policies. Finding successful policies is a feasibility problem for which …

    calgary Repository record for Machine Learning for Designing Fast Quantum Gates (opens in a new tab)

  17. Super Greedy Type Algorithms and Applications In Compressed Sensing

    In this manuscript we study greedy-type algorithms such that at a greedy step we pick several dictionary elements contrary to a single dictionary element in standard greedy-type algorithms. We call such greedy algorithms super greedy type algorithms. In the general setting, we propose several new …

    south-carolina Repository record for Super Greedy Type Algorithms and Applications In Compressed Sensing (opens in a new tab)

  18. Performance issues in cellular wireless mesh networks

    … MCCT algorithm, this thesis proposes a series of greedy algorithms for channel assignment and routing in CMESH cells. Simulation results show that these greedy algorithms can significantly improve the capacity of CMESH cells, compared with algorithms proposed by other researchers.

    sask Repository record for Performance issues in cellular wireless mesh networks (opens in a new tab)

  19. Theory and techniques for synthesizing efficient breadth-first search algorithms

    The development of efficient algorithms to solve a wide variety of combinatorial and planning problems is a significant achievement in computer science. Traditionally each algorithm is developed individually, based on flashes of insight or experience, and then (optionally) verified for correctness. …

    texas Repository record for Theory and techniques for synthesizing efficient breadth-first search algorithms (opens in a new tab)

Page 1 of 6