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 359 for “"greedy"”.
-
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.</p>
-
Greedy Hunger and Happy Ruin
Greedy Hunger and Happy Ruin is a collection of poems that gathers a life of fragments and frayed ends into a loose narrative of desire, loss, language, and almost redemption. The poems examine the costs of leaving home, as seen in a mermaid's wish to become human, an immigrant family's aspirations …
-
Greedy Feature Selection in Tree Kernel Spaces
… context of Support Vector learning, based on a greedy exploration of the fragment space. Features are selected according to a gradient norm preservation criterion, i.e. we select the heaviest features that account for a large percentage of the gradient norm, and are explicitly modeled and …
-
Greedy structure learning of Markov Random Fields
… we introduce an adaptive forward-backward greedy algorithm for learning the structure of a discrete, pairwise MRF given a high dimensional set of i.i.d. samples. The algorithm works by greedily estimating the neighborhood of each node independently through a series of forward and backward …
-
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 …
-
Greedy layerwise training of convolutional neural networks
Layerwise training presents an alternative approach to end-to-end back-propagation for training deep convolutional neural networks. Although previous work was unsuccessful in demonstrating the viability of layerwise training, especially on large-scale datasets such as ImageNet, recent work has …
-
The Greedy Triangulation in an X Window Environment
No abstract prepared.
-
Greedy Algorithms In Approximation Theory and Compressed Sensing
… most successful approaches in this area is the greedy method, which belongs to the theory of nonlinear approximation. This dissertation answers the question for some greedy type methods. We approach the problem from two aspects, Nonlinear Approximation Theory and Compressed Sensing. In the …
-
Parallelisation of greedy algorithms for compressive sensing reconstruction
… the fastest reconstruction techniques, known as greedy pursuits, reconstruction of large problems can pose a significant burden, consuming a great deal of memory as well as compute time. Parallel computing is the foundation of the field of High Performance Computing (HPC). Modern supercomputers …
-
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 …
-
Performance bounds for greedy strategies in submodular optimization problems
To view the abstract, please see the full text of the document.
-
Greedy Algorithm and M-Term Trigonometric Approximation: A Survey
… of the paper [3] on the effectiveness of a Greedy Algorithm for best m-term trigonometric approximations for those unfamiliar with the subject and its methods. In particular, we will provide careful proofs of the three main theorems in that paper, providing details to the reader which are …
-
Super Greedy Type Algorithms and Applications In Compressed Sensing
<p>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 …
-
Efficient 𝐻₂-Based Parametric Model Reduction via Greedy Search
… 𝐻-infinity approximations, we develop a greedy algorithm for efficiently modeling large-scale parametric dynamical systems in an 𝐻₂-sense. We demonstrate the effectiveness of this greedy search on a fluid problem, a mechanics problem, and a thermal problem. We also investigate Bayesian …
-
A Greedy Search Algorithm for Maneuver-Based Motion Planning of Agile Vehicles
This thesis presents a greedy search algorithm for maneuver-based motion planning of agile vehicles. In maneuver-based motion planning, vehicle maneuvers are solved offline and saved in a library to be used during motion planning. From this library, a tree of possible vehicle states can be …
-
On the throughput efficiency of greedy maximal scheduling in wireless ad hoc networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in degraded throughput performance in general wireless networks. In this thesis, we derive performance bounds of GMS for …
-
A sensitivity-driven greedy approach to fluence map optimization in intensity-modulated radiation therapy
… the dose-volume constraints. We propose a new greedy algorithm and show that it converges to a local minimum of the stated formulation of the fluence map problem. Numerical comparison is made to an approach representative of the leading commercial software for IMRT planning. We find our method …
-
The Greedy Eaters: A moral politics of continuity and consumption in urbanising central Kenya
… Consuming figures are condemned as immoral ‘greedy eaters’ in a variety of ways. Adopting the term ‘moral politics’, this thesis identifies moral debate about economic practice as an important and understudied terrain of anthropological inquiry. Departing from conventional understandings of …
Page 1 of 18