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 187 for “"Fast algorithms"”.
-
Fast Algorithms for Tomography
This thesis presents and analyzes several novel algorithms and techniques for processing tomographic data that are significantly faster and more accurate than existing fast methods. First, a new fast reconstruction algorithm based on a hierarchical decomposition of the back-projection operation is …
-
Fast algorithms for minimally supervised learning
… infeasible to obtain. This dissertation develops fast, theoretically grounded algorithms for minimally supervised learning, with emphasis on statistical guarantees, spectral approximation, and scalable computation in high-dimensional regimes. The first part studies density-based clustering. We …
-
Fast algorithms for DFT and convolution
… efficiently, have been combined to give two algorithms viz. Nested Fourier Algorithm (NFA -- using linear multidimensional map) and Index Fourier Algorithm (IFA using a non-linear Index map). The two algorithms have been compared for the amount of arithmetic computations required. The …
-
Fast Algorithms for Sampled Multiband Signals
… properties. However, prior to this research, no fast algorithms for working with the Slepian basis had been developed. As such, practitioners often overlooked the Slepian basis vectors for more computationally efficient tools, such as the FFT, even in problems for which the Slepian basis vectors …
-
Fast algorithms for Bayesian variable selection
… with large number of features, we aim to develop fast algorithms for Bayesian variable selection, which approximate the true posterior distribution, but yet still return the right inference (at least asymptotically). In this thesis, we start with a variational algorithm for linear regression. Our …
-
Fast algorithms for frequency domain wave propagation
… and asymptotic complexity estimates of direct algorithms such as the multifrontal method are too costly for such problems. Thus, iterative solvers must be used. In this dissertation, I will present fast algorithms which, in conjunction with GMRES, allow the solution of the forward problem in …
-
FAST ALGORITHMS FOR TRANSFORM DOMAIN ADAPTIVE FILTERS
… signal processing, a wide variety of recursive algorithms have been developed in the literature for the implementation of adaptive filters. Among them, the least mean square (LMS) algorithm is the most popular one, due to its simplicity and robustness to finite word-length effects. The …
-
Fast Algorithms for Large-Scale Phylogenetic Reconstruction
… data available to biologists increases, very fast phylogenetic reconstruction algorithms are becoming necessary. Currently, large sequence alignments can contain up to hundreds of thousands of sequences, making traditional methods, such as Neighbor Joining, computationally prohibitive. To …
-
Fast algorithms for retiming large digital circuits
… and Saxe, who introduced the concept, presented algorithms for period optimization (minperiod retiming) and area optimization (minarea retiming). The ASTRA algorithm proposed an alternative view of retiming using the equivalence between retiming and clock skew optimization;The first part of this …
-
Fast algorithms for small particle scattering problems
… The idea in this method is using randomized algorithms for low rank approximating of matrices. When implemented using special kinds of random matrices, the computational complexity of the multilevel solver is comparable to that of the fast multipole method. These methods, however, require …
-
Computationally fast algorithms for ARMA spectral estimation
… maximum entropy methods. In this dissertation, fast recursive algorithmic implementations of the high performance method are developed. They are recursive in the sense that as a new element of the time series is observed, the parameters characterizing an ARMA spectral estimate are …
-
Fast Algorithms for $\ell_p$-Regression and Other Problems
… in a linear subspace. In this thesis, we give fast, high-accuracy algorithms for $\ell_p$ regression for all $p\geq 2$. Our algorithms are built on novel techniques including {\it iterative refinement for $\ell_p$-norms}, and a fast {\it width-reduced} multiplicative weight update routine among …
-
Fast Algorithms on Random Matrices and Structured Matrices
… with randomly generated matrices has enabled fast algorithms to perform well for some most fundamental problems of numerical algebra with probability close to 1. The dissertation develops a set of algorithms with random and structured matrices for the following applications: 1) We prove that …
-
Novel Fast Algorithms For Low Rank Matrix Approximation
… which can be orthogonal, random, and allowing fast multiplication by a vector. The Subsampled Randomized Hadamard Transform (SRHT) is the most popular among transforms. An m x n matrix can be multiplied by an n x l SRHT matrix in O(mn log l) arithmetic operations where typically l << min(m, n). …
-
Fast algorithms for surface embedded graphs via homology
Made available in DSpace on 2014-01-16T17:54:48Z (GMT). No. of bitstreams: 3 Kyle_Fox.pdf: 3026914 bytes, checksum: c71a059d2688d88bc4678429df958563 (MD5) dissertation.zip: 35243792 bytes, checksum: 5c50fb8cf2afd614d071c635e5821a34 (MD5) license.txt: 4058 bytes, checksum: …
-
Studies on Sturm-Liouville wavelets and fast algorithms
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1995
-
Fast algorithms for wavelet-based analysis of hyperspectral signatures
… that might exist between the outputs of the algorithms.
Page 1 of 10