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 72 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 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 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 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 …
-
Fast algorithms for vector quantization picture coding
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1984.
-
Fast Algorithms for Bounded-Range LIS Approximation
We introduce an improvement to additive approximation of Longest Increasing Subsequence (LIS) of a sequence with a bounded number of unique elements. In particular, for a sequence 𝑓 of length 𝑛 with 𝑟 unique elements and 𝜖 additive error paramenter, we present an algorithm that approximate the size …
-
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 …
-
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: …
-
Fast algorithms for wavelet-based analysis of hyperspectral signatures
… that might exist between the outputs of the algorithms.
-
Fast algorithms for Brownian dynamics simulation with hydrodynamic interactions
… u, v are vectors of length 3N. Thus, classical algorithms require O(N^2) operations for computing Du and O(N^3) operations for computing [square root]Dv, which are prohibitively expensive and render large scale simulations impossible since one needs to carry out these calculations many times in …
-
Fast Algorithms for Volterra-Series-Based Nonlinear Adaptive Filters
Two efficient algorithms for the second-order adaptive Volterra filter are developed in Chapter 2. By utilizing the special structure of the input correlation matrix of the Volterra filter the two algorithms essentially implement quasi-Newton algorithm with $O\lbrack {\rm N}\sp2\rbrack$ …
-
Graph diffusions and matrix functions: fast algorithms and localization results
… of edges, the scalability of network analysis algorithms becomes increasingly important. Whereas many standard graph algorithms rely on matrix-vector operations that require exploring the entire graph, this thesis is concerned with graph algorithms that are local (that explore only the graph …
-
FAST ALGORITHMS FOR SEPARATING AND TRACKING SOURCES IN ADAPTIVE ARRAYS
… is well known. However, many conventional algorithms still suffer from various limitations in enhancing directional signals and will not function properly in situations when the desired signal is strong and in motion or when there are multiple signal sources. In this thesis, a few new …
-
High resolution signal and image recovery: Fast algorithms and analysis
… arising in signal recovery problems: developing fast and efficient algorithms for convex set constrained signal recovery, analyzing resolution limits in signal recovery algorithms, and developing new regularization techniques for reducing the ill effects of noise in signal recovery algorithms.
-
Fast algorithms for solving integral equations of electromagnetic wave scattering
… and complex objects. This dissertation develops fast numerical algorithms for solving two-dimensional and three-dimensional integral equations of electromagnetic wave scattering. They include: (1) The fast iterative method, which reduces the matrix-vector multiplication from $N\sp2$ to …
-
Fast Algorithms For Fragment Based Completion In Images Of Natural Scenes
Textures are used widely in computer graphics to represent fine visual details and produce realistic looking images. Often it is necessary to remove some foreground object from the scene. Removal of the portion creates one or more holes in the texture image. These holes need to be filled to …
-
Optimal entropy estimation on large alphabet: fundamental limits and fast algorithms
Consider the problem of estimating the Shannon entropy of a distribution over k elements from n independent samples. We obtain the minimax mean- square error within universal multiplicative constant factors if n exceeds a constant factor of k/log(k); otherwise there exists no consistent estimator. …
-
Fast Algorithms for the Design and Analysis of Large Power Grids
… due to the bottleneck of simulation. We propose algorithms to determine the placement of power pads that minimize not only the worst voltage drop but also the voltage deviation across the power grid. Our algorithm uses simulated annealing to minimize the total cost of voltage drops. The key …
-
Two Novel Fast Algorithms for Analysis of Low-Frequency Transient Electromagnetic Phenomena
Finally, this dissertation introduced a novel fast low-frequency TDIE solver that is augmented by the LF-TD-FMM algorithm and uses loop-patch basis functions and integral/differential form of TDIE to improve its efficiency and stability. This fast solver can be used for full-wave analysis of …
Page 1 of 4