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 “"Optimal Algorithms"”.
-
Optimal algorithms for Byzantine agreement
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1988.
-
Time-Optimal Algorithms on Meshes With Multiple Broadcasting
… family of computers. In recent years, efficient algorithms to solve a number of computational problems on meshes with multiple broadcasting have been proposed in the literature.</p> <p>The problems considered in this thesis are semigroup computations, sorting, multiple search, various …
-
Globally optimal algorithms for multiple-transform signal compression
… compaction. We propose two new methods to select optimal transforms for different blocks in a signal. The first method is based on thresholding, while the second method is based on dynamic programming and related to the multiple-choice knapsack problem. These algorithms are then compared to two …
-
Optimal Algorithms for Blind Source Separation - Application to Acoustic Echo Cancellation
We are all familiar with the sound which can be viewed as a wave motion in air or other elastic media. In this case, sound is a stimulus. Sound can also be viewed as an excitation of the hearing mechanism that results in the perception of sound. The interaction between the physical properties of …
-
Assortment and inventory optimization : from predictive choice models to near-optimal algorithms
Finding optimal product offerings is a fundamental operational issue in modern retailing, exemplified by the development of recommendation systems and decision support tools. The challenge is that designing an accurate predictive choice model generally comes at the detriment of efficient …
-
Provably near-optimal algorithms for multi-stage stochastic optimization models in operations management
… the future horizon. Unfortunately, computing the optimal policies is usually computationally intractable due to curse of dimensionality. This thesis is focused on providing provably near-optimal and tractable policies for some of these challenging models arising in the context of inventory …
-
Efficient Bandwidth Reservation Strategies for Data Movements on High Performance Networks
… problems, and fast and efficient heuristic algorithms are proposed. While the two subproblems of the second problem can be optimally solved in polynomial time. The corresponding optimal algorithms and proofs are given. We conduct extensive simulations to compare the performance of the …
-
Learning with classical and quantum information constraints
… it is important to design data-efficient algorithms under information restrictions. This thesis establishes a general framework for proving the fundamental limit of information-constrained learning and designs sample-optimal algorithms under settings of practical interest. We consider …
-
High-performance computing with PetaBricks and Julia
… two languages to re-examine classic numerical algorithms in new approaches for high-performance computing. PetaBricks is an implicitly parallel language that allows programmers to naturally express algorithmic choice explicitly at the language level. The PetaBricks compiler and autotuner is not …
-
High Performance Issues on Parallel Architectures
… of the architecture to graph theory produces optimal algorithms for graph properties such as spanning forest bipartiteness, fundamental cycles, bridges and biconnected components. Other optimal algorithms for the more complex least common ancestor and the connected component problems are also …
-
Computational image analysis of subcellular dynamics in time-lapse fluorescence microscopy
The use of image segmentation and motion tracking algorithms was adapted for analyzing time-lapse data of cells with fluorescently labeled protein. Performance metrics were devised and algorithm parameters were matched to hand-created ground-truth data. The performance of these algorithms in this …
-
ROAD : Rapid Optical Asteroid Detection
… Transform (3DRT), efficient image processing algorithms capable of identifying streaks at the detection limit in video of the night sky. Tilt and the 3DRT are asymptotically optimal algorithms for the blind search problem, which seeks to identify near-Earth asteroids of arbitrary position and …
-
A Metastudy of Algorithm Lower Bounds
Algorithms are essential to the field of computer science, and algorithm designers are always searching for the mathematically optimal algorithms. Sherry and Thompson found that improvements to algorithm upper bounds have been steadily decreasing since the 1970s. In this work we aim to discover …
-
Sublinear algorithms for Earth Mover's Distance
… over infinite domains. Instead, our algorithms depend on other parameters, such as the diameter of the domain space, which may be significantly smaller. We also prove lower bounds showing our testers to be optimal in their dependence on these parameters. Additionally, we consider …
-
Reconfiguration of Fault-Tolerant VLSI Systems
… present fast (and in many cases asymptotically optimal) algorithms. For the NP-hard reconfiguration problems, we propose several strategies. For some problems, polynomial time approximation algorithms are presented that yield provably good, but not necessarily optimal, solutions. For some …
-
Problems in Sorting and Graph Algorithms
… The first problem concerns the determination of optimal algorithms with respect to a new model for evaluating sorting algorithms. We did an exhaustive search for such algorithms. The second problem concerns a conjecture that every sorting algorithm on some input involves every key in O(log n) …
-
Rotorcraft Flight Dynamics and Control in Wind for Autonomous Sampling of Spatiotemporal Processes
… unmanned rotorcraft for spatiotemporal sampling, optimal algorithms are developed for two sampling objectives: (1) sampling continuous spatiotemporal fields modeled as Gaussian processes, and (2) optimal motion planning for coordinated target detection, which is an example of a discrete …
-
Simulating underwater sensor networks and routing algorithms in MATLAB
… of information it is possible to achieve near-optimal results with energy costs considerably lower than centralized optimal algorithms. We demonstrate this by constructing and evaluating a custom simulation environment in MATLAB. This is implemented in a mixed procedural and array-centric …
-
Design of discrete-time filters for efficient implementation
… are pursued. The first develops low-complexity algorithms that are shown to yield optimal or near-optimal designs in many instances, but without guarantees. The second focuses on optimal algorithms based on the branch-and-bound procedure. The complexity of branch-and-bound is reduced through the …
-
UNMANNED AERIAL SYSTEMS (UAS) IMAGE PREPROCESSING TO REDUCE ARTIFACTS AND IMPROVE GEOMETRIC REGISTRATION WHEN GENERATING ORTHOPHOTO MOSAICS AND 3D MODELS
… object movement between photos, or sub-optimal algorithms. The goal of this research was to develop preprocessing algorithms that would filter movement (or other time or position-based differences) and areas of homogeneity. The hypothesis is that filtering these parts of the image would …
Page 1 of 3