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 9 of 9 for “"FASTER algorithm"”.
-
Remote sensing of rapidly draining supraglacial lakes on the Greenland Ice Sheet
… lake area and volume tracking method (“the FAST algorithm”). For this, various methods for automatically calculating lake areas and volumes with MODIS are tested, and the best techniques are incorporated into the FAST algorithm. The FAST algorithm is applied to the land-terminating Paakitsoq and …
-
An algorithmic approach to continuous location
… problem, an inefficient implementation of the algorithm is given, which runs in pseudo-polynomial time, using a previously developed algorithm and a construction. We then derive from it a much faster algorithm using a top-down greedy technique, which runs in polynomial time. The algorithms have …
-
Cuts and connectivity in graphs and hypergraphs
… main results are the following: - We introduce a faster algorithm for finding the reduced graph in element-connectivity computations. We also show its application to node separation. - We present several results on hypergraph cuts, including (a) a near linear time algorithm for finding a …
-
Algorithms for Subset Sum using linear sketching
… NP-complete but to admit pseudo-polynomial time algorithms and, recently, algorithms running in near-linear pseudo-polynomial time were developed [9, 211. For the modular case, however, the best known algorithm by Koiliaris and Xu [21] runs in time 0̃ (m⁵/⁴). In this thesis we tackle this problem …
-
The Atomic-scale Finite Element Method for Analyzing Mechanical Behavior of Carbon Nanotube and Quartz
… of the number of atoms, O(N²). Recently, a faster algorithm, Atomic-scale Finite Element Method (AFEM) with computational time proportional to the number of atoms, O(N), had been developed. The main idea of AFEM, compared with conventional finite element method is to replace nodes with atoms …
-
Shortest paths, Markov chains, matrix scaling and beyond : improved algorithms through the lens of continuous optimization
… to make progress on a number of fundamental algorithmic problems: *-- We develop a faster algorithm for the unit capacity minimum cost flow problem, which encompasses the shortest path with negative weights and minimum cost bipartite perfect matching problems. In the case of sparse graphs, …
-
Inferring subglacial hydrology from investigations of supraglacial lake drainages and meltwater plumes at Store Glacier, West Greenland
… drainage were analysed with the dual-satellite FASTER algorithm, and meltwater plume areas were assessed through time-lapse photogrammetry in the Python toolbox PyTrx, in order to reconstruct the subglacial hydrology of the tidewater glacier Store Glacier in West Greenland during the 2018 summer …
-
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 …
-
Combinatorial Algorithms for Server Allocation Problem
… velocity is also given as input. We present new algorithms for the Euclidean bipartite matching problem, showing improvements over existing algorithms. In particular, for two point sets $A, B subset mathbb{R}^d$ with $|A| = |B| = n$ and dimension $d > 1$ being constant, we developed: …