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 15 of 15 for “"Spectral algorithms"”.

  1. Statistical Spectral Algorithms for Learning from Discrete Data

    … development of efficient, robust, and accurate algorithms tailored to handle discrete data has become a focal point of interest across various applications, including recommendation systems, the social sciences, and psychometrics, among others. The present thesis contributes to this dynamic and …

    penn Repository record for Statistical Spectral Algorithms for Learning from Discrete Data (opens in a new tab)

  2. Advances in Spectral Learning with Applications to Text Analysis and Brain Imaging

    Spectral learning algorithms are becoming increasingly popular in data-rich domains, driven in part by recent advances in large scale randomized SVD, and in spectral estimation of Hidden Markov Models. Extensions of these methods lead to statistical estimation algorithms which are not only fast, …

    penn Repository record for Advances in Spectral Learning with Applications to Text Analysis and Brain Imaging (opens in a new tab)

  3. On Graph Coloring, Max Cut, and Semidefinite Rank

    … the performance of several max cut approximation algorithms. In particular, we compare the results of the Goemans and Williamson algorithm using semidefinite programming with Trevisan's algorithm using spectral partitioning. The former algorithm has a known .878 approximation guarantee whereas the …

    cornell Repository record for On Graph Coloring, Max Cut, and Semidefinite Rank (opens in a new tab)

  4. Local Features to a Global View: Recognition of Occluded Objects by Spectral Matching Using Pairwise Feature Relationships

    In this research, our algorithms to solve the recognition of occluded object problem are formulated by a local to global strategy, namely making a recognition decision (global) based on local information collected. This local to global nature of occlusion recognition has brought us to spectral …

    nus Repository record for Local Features to a Global View: Recognition of Occluded Objects by Spectral Matching Using Pairwise Feature Relationships (opens in a new tab) Download file for Local Features to a Global View: Recognition of Occluded Objects by Spectral Matching Using Pairwise Feature Relationships (opens in a new tab)

  5. CONFOUNDING CONSTITUENTS IN REMOTE SENSING OF PHYCOCYANIN

    … water quality constituents. Previously published spectral algorithms for the detection of phycocyanin were evaluated against lab measured pigment concentrations using linear least squares regression. Algorithm performance varied across study sites (best performing models by reservoir resulted in …

    iupui Repository record for CONFOUNDING CONSTITUENTS IN REMOTE SENSING OF PHYCOCYANIN (opens in a new tab)

  6. Statistical Inference and the Sum of Squares Method

    … which generalizes linear programming and spectral algorithms. We use this approach to design algorithms for a range of high-dimensional statistical problems, improving on state-of-the-art provable guarantees in several well-studied settings: clustering data from high-dimensional mixture …

    cornell Repository record for Statistical Inference and the Sum of Squares Method (opens in a new tab)

  7. Polarimetric Remote Sensing in the Visible to Near Infrared

    … another dimension to the spatial intensity and spectral information typ ically acquired in remote sensing. Polarization imparted by surface reflections contains unique and discriminatory signatures which may augment spectral target-detection tech niques. Benefits such as improving man-made …

    rit Repository record for Polarimetric Remote Sensing in the Visible to Near Infrared (opens in a new tab)

  8. A Model for the Estimation of Residual Stresses in Soft Tissues

    … work deals with developing a nonlinear inverse spectral technique that allows one to accurately compute the residual stresses in soft tissues. Unlike most conventional experimental, both in vivo and in vitro, and theoretical techniques to characterize residual stresses in soft tissues, the …

    tamu Repository record for A Model for the Estimation of Residual Stresses in Soft Tissues (opens in a new tab)

  9. Chernoff Information in Community Detection

    … all available signal, we need scalable algorithms that can incorporate both network connectivity data and additional insight from vertex covariates. In addition, it can be prohibitively expensive to observe the entire graph in many real applications, especially for large graphs. Thus it …

    jhu Repository record for Chernoff Information in Community Detection (opens in a new tab)

  10. COMPUTATIONALLY EFFICIENT AND ROBUST METHODS FOR LARGE-SCALE OPTIMIZATION AND SCIENTIFIC COMPUTING

    … design and analysis of computationally efficient algorithms for large-scale optimization and scientific computing. It aims to address two primary challenges: on one hand, to expand our understandingof the behavior of first-order optimization methods, which enjoy widespread success solving …

    cornell Repository record for COMPUTATIONALLY EFFICIENT AND ROBUST METHODS FOR LARGE-SCALE OPTIMIZATION AND SCIENTIFIC COMPUTING (opens in a new tab)

  11. Stability of spectral learning algorithms: theory, methodologies and applications

    … and explain the behavior of learning algorithms. Based on such theoretical tools the comparison and analysis of algorithms can be based on rigorous and sound criteria other than simply their empirical behavior. In this context, an important criterion that is widely used for assessing …

    greece Repository record for Stability of spectral learning algorithms: theory, methodologies and applications (opens in a new tab)

  12. Algorithms and analysis for non-convex optimization problems in machine learning

    In this thesis, we propose efficient algorithms and provide theoretical analysis through the angle of spectral methods for some important non-convex optimization problems in machine learning. Specifically, we focus on two types of non-convex optimization problems: learning the parameters of latent …

    gatech Repository record for Algorithms and analysis for non-convex optimization problems in machine learning (opens in a new tab)

  13. Using Lidar to geometrically-constrain signature spaces for physics-based target detection

    … task when performing target detection on spectral imagery is ensuring that a target signature is in the same metric domain as the measured spectral data set. Remotely sensed data are typically collected in digital counts and calibrated to radiance. That is, calibrated data have units of …

    rit Repository record for Using Lidar to geometrically-constrain signature spaces for physics-based target detection (opens in a new tab)

  14. Statistical modeling and inferences on directed networks

    … the sender and receiver peripheries, we propose spectral algorithms to identify the CP structure in weighted directed networks. Our algorithm stands out with statistical guarantees, ensuring the identification of sender and receiver peripheries with overwhelmingly probability. Additionally, our …

    colostate Repository record for Statistical modeling and inferences on directed networks (opens in a new tab)

  15. Characterization of Smoke Particles Toward Improved Remote Sensing Retrievals and Chemical Transport Modeling

    … between the improved and the traditional bi-spectral algorithms via a Williams Flats fire test case during the 2019 FIREX-AQ campaign show the improved algorithm outputs a lower fire temperature but significantly larger fire area fraction than the traditional method. It implies that this new …

    wustl Repository record for Characterization of Smoke Particles Toward Improved Remote Sensing Retrievals and Chemical Transport Modeling (opens in a new tab)