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 29 for “"Randomized Algorithm"”.
-
Faster algorithms for convex and combinatorial optimization
In this thesis, we revisit three algorithmic techniques: sparsification, cutting and collapsing. We use them to obtain the following results on convex and combinatorial optimization: --Linear Programming: We obtain the first improvement to the running time for linear programming in 25 years. The …
-
Deterministic algorithms for the Lovász Local Lemma
… formula has a satisfying assignment. Recently, a randomized algorithm to efficiently construct a satisfying assignment was given by Moser [17]. Subsequently Moser and Tardos [18] gave a randomized algorithm to construct the structures guaranteed by the LLL in a very general algorithmic framework. …
-
Human-automation collaborative RRT for UAV mission path planning
… Recent work has proposed the use of a randomized algorithm known as the Rapidly exploring Random Tree (RRT) algorithm for path planning. While capable of finding feasible solutions quickly, it is unclear how well a human operator will be able to supervise a team of UAVs that are …
-
Human-RRT collaboration in Unmanned Aerial Vehicle mission path planning
… zones. Recently common choices of path finding algorithms have used variations of a randomized algorithm called Rapidly exploring Random Tree (RRT). This randomized sampling algorithm finds fairly short feasible paths, and it finds them efficiently, however human operators supervising UAV …
-
A study of fast, robust stereo-matching algorithms
… for foreshortening effects. We propose an algorithm that allows a matching window to locally deform according to the surface orientation of the imaged point. The algorithm then performs correlation in multiple dimensions to simultaneously determine the most probable depth and tilt. The 2D …
-
Obstacle Navigation Decision-Making: Modeling Insect Behavior for Robot Autonomy
… in analysis, we extracted a state-based algorithm that makes these types of decisions stochastically and also captures the shelter seeking bias in the path length of cockroaches. We call this algorithm RAMBLER, Randomized Algorithm Mimicking Biased Lone Exploration in Roaches. Further we …
-
Collaborative UAV path planning with deceptive strategies
… discrete optimization techniques, a recursive algorithm and a Mixed Integer Linear Programming (MILP) model, that seek a unique optimal trajectory for a team of SUAVs or agents for a given environment. We then develop a set of heuristics governing the agents' optimal strategy or policy within …
-
Tolerant Testing of Regular Languages in Sublinear Time
… it can be useful to provide tolerant testers: algorithms that accept when 𝑤 is 𝛿-close and reject when 𝑤 is 𝜖-far, for 𝛿 < 𝜖. We build on the work of Alon, Krivelevich, Newman and Szegedy [1] to provide a tolerant, constant time property tester for regular languages. Our main result is that …
-
APPLICATIONS OF GAUSSIAN FIELDS TO THE PERMANENT AND THE MATCHING POLYNOMIAL
… first part of this thesis, we introduce a new randomized algorithm that leverages a form of Wick's theorem to estimate the permanent of a real matrix. In particular, we do this by viewing the permanent as the expectation of a product of centered joint Gaussian random variables with a particular …
-
Testability of linear-invariant properties
Property Testing is the study of super-efficient algorithms that solve "approximate decision problems" with high probability. More precisely, given a property P, a testing algorithm for P is a randomized algorithm that makes a small number of queries into its input and distinguishes between whether …
-
Applications of a Novel Sampling Technique to Fully Dynamic Graph Algorithms
… sampling technique to building fully-dynamic randomized graph algorithms. We present the following results: \begin{enumerate} \item A randomized algorithm to estimate the size of a cut in an undirected graph $G = (V, E)$ where $V$ is the set of nodes and $E$ is the set of edges and $n = |V|$ …
-
Decoding algorithms for complex natural language tasks
… As an alternative, we also present a novel randomized algorithm which can guarantee an arbitrarily high probability of finding the optimal solution. We apply these methods to the task of constructing temporal graphs and to the task of title generation. Second, we are interested in carefully …
-
Quantum speedups in query complexity
In this thesis, we study randomized and quantum algorithms in the query complexity model. We investigate when and by how much quantum algorithms provide a speedup over the best possible classical algorithm in the query complexity setting. We introduce a total Boolean function that exhibits a power …
-
The Gowers norm in the testing of Boolean functions
A property tester is a fast, randomized algorithm that reads only a few entries of the input, and based on the values of these entries, it distinguishes whether the input has a certain property or is "different" from any input having this property. Furthermore, we say that a property tester has …
-
Efficient and private distance approximation in the communication and streaming models
… stream is presented in an arbitrary order to a randomized algorithm that tries to approximate certain statistics of tile data with only a few (usually one) passes over the data. For instance, the data may be a flow of packets on the internet or a set of records in a large database. The size of …
-
Compositional analysis of the effects of uncertainty on computations
… also resort to intentionally adding approximate algorithms and machine learning models to such computations in order to make them tractable. Uncertainty analyses provide developers with the means to ensure that uncertainty introduced into a computation in this manner does not lead to unwanted or …
-
Compositional analysis of the effects of uncertainty on computations
… also resort to intentionally adding approximate algorithms and machine learning models to such computations in order to make them tractable. Uncertainty analyses provide developers with the means to ensure that uncertainty introduced into a computation in this manner does not lead to unwanted or …
-
Higher Compression from the Burrows-Wheeler Transform with New Algorithms for the List Update Problem
… and Frequency Count are some of the many algorithms used on the List Update problem. In 1985, Competitive Analysis first showed the superiority of Move-To-Front over Transpose and Frequency Count for the List Update problem with arbitrary data. Earlier studies due to Bitner assumed …
-
Efficient algorithms for learning mixture models
… to the distribution. We propose a learning algorithm that accurately recovers the underlying matrix using 9(M) number of samples, which immediately lead to improved learning algorithms for various mixture models including topic models and HMMs. We show that the linear sample complexity is …
-
New results on some quadratic programming problems
In this thesis we present new effective algorithms for several special classes of quadratic programming problems. The problems we study can be classifiedinto two categories. The first group contains two optimization problems with binary constraints. To solve these problems, we first explore some …
Page 1 of 2