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 226 for “"Fundamental problem"”.

  1. Poverty mapping : what can we really learn?

    I examine the problem of poverty mapping. I explain the difficulties of small area estimation arising from data sparseness and argue that any attempt to overcome this fundamental problem has to take the form of a conditional homogeneity assumption.

    cape-town Repository record for Poverty mapping : what can we really learn? (opens in a new tab)

  2. Towards Uncovering the True Use of Unlabeled Data in Machine Learning

    Knowing how to exploit unlabeled data is a fundamental problem in machine learning. This dissertation provides contributions in different contexts, including semi-supervised learning, positive unlabeled learning and representation learning. In particular, we ask (i) whether is possible to learn a …

    trento Repository record for Towards Uncovering the True Use of Unlabeled Data in Machine Learning (opens in a new tab)

  3. Qualitative reasoning about fluids and mechanics

    … commonsense knowledge about physical world is a fundamental problem in building intelligent systems. If this knowledge can be represented and used by computers, they can duplicate people's ability to understand and interact with the world. Qualitative physics is the attempt to capture and …

    uiuc Repository record for Qualitative reasoning about fluids and mechanics (opens in a new tab)

  4. Shape Modeling and Analysis for Object Representation, Reconstruction, and Recognition

    Shape Modeling constitutes a fundamental problem in computer vision. Complexity of the problem arises from the variability of shape realizations, which may be due to their inherent variability or introduced because of adverse situations like noise, pose problem, occlusion, etc. In this thesis, we …

    ncsu Repository record for Shape Modeling and Analysis for Object Representation, Reconstruction, and Recognition (opens in a new tab)

  5. Vibrational Dynamics in Disordered Molecular Crystals by Picosecond Coherent Raman and Photon Echo Spectroscopies (Exciton, Low Temperature)

    … vibrational dynamics in complex molecules is a fundamental problem in chemical physics and is important for discerning how vibrational relaxation effects actual chemical reaction rates. The natural states of a pure crystal, however, are delocalized excitons and are described by the language of …

    uiuc Repository record for Vibrational Dynamics in Disordered Molecular Crystals by Picosecond Coherent Raman and Photon Echo Spectroscopies (Exciton, Low Temperature) (opens in a new tab)

  6. A Semiotic Phenomenology of the Boxers' Movements: A Contribution to A Hermeneutics of Historical Interpretation

    … between 1898 and 1901, I have indicated the fundamental problem: the sources are insufficient and have to be examined hermeneutically (interpreted as texts). That is, history and its production contain the problematics of temporality, causality, facts vs. meaning, data vs. realities. I …

    uiuc Repository record for A Semiotic Phenomenology of the Boxers' Movements: A Contribution to A Hermeneutics of Historical Interpretation (opens in a new tab)

  7. Boundaries of K-types in discrete series

    Abstract: A fundamental problem about irreducible representations of a reductive Lie group G is understanding their restriction to a maximal compact subgroup K. In certain important cases, known as the discrete series, we have a formula that gives the multiplicity of any given irreducible …

    mit Repository record for Boundaries of K-types in discrete series (opens in a new tab)

  8. A computational approach to understanding spatial and temporal granularities in agent-based modeling

    … set of computational challenges to investigate a fundamental problem in spatially explicit epidemic agent-based modeling. This research demonstrates that coarsening spatial and temporal granularities influence both computational tractability and epidemic ABM processes. By focusing on the nexus of …

    uiuc Repository record for A computational approach to understanding spatial and temporal granularities in agent-based modeling (opens in a new tab)

  9. Scalable second-order Riemannian optimization for K-means clustering

    Clustering is a fundamental problem in unsupervised learning. The classical K-means formulation for clustering is a worst-case NP-hard discrete optimization problem. Despite being NP-hard, the SDP relaxation of the discrete formulation is guaranteed to recover the true cluster whenever it is …

    uiuc Repository record for Scalable second-order Riemannian optimization for K-means clustering (opens in a new tab)

  10. Effects of Data Heterogeneity on Distributed Linear System Solvers

    We focus on the fundamental problem of solving a system of linear equations. In particular, we are interested in distributed linear system solvers, where one taskmaster coordinates any number of workers to attain a solution. There are two predominant and fundamentally different ways of doing this: …

    mit Repository record for Effects of Data Heterogeneity on Distributed Linear System Solvers (opens in a new tab)

  11. Covariance estimation on matrix manifolds

    The estimation of covariance matrices is a fundamental problem in multivariate analysis and uncertainty quantification. Covariance matrices are an essential modeling tool in climatology, econometrics, model reduction, biostatistics, signal processing, and geostatistics, among other applications. In …

    mit Repository record for Covariance estimation on matrix manifolds (opens in a new tab)

  12. Estimating Reachability Set Sizes in Dynamic Graphs

    … trade-offs. In this thesis we study the problem of computing the reachability set size of a vertex, which is a fundamental problem, with applications in databases and social networks. We develop the first Giraph based algorithms for different dynamic versions of these problems, which …

    vt Repository record for Estimating Reachability Set Sizes in Dynamic Graphs (opens in a new tab)

  13. Toward Controllable and Robust Surface Reconstruction from Spatial Curves

    … surface from a set of spatial curves is a fundamental problem in computer graphics and computational geometry. It often arises in many applications across various disciplines, such as industrial prototyping, artistic design and biomedical imaging. While the problem has been widely studied …

    wustl Repository record for Toward Controllable and Robust Surface Reconstruction from Spatial Curves (opens in a new tab)

  14. Kinetic analysis of leaching reactions in multi-component mineral systems

    … systems requires developing methods to solve the fundamental problem of identity and resolve the partitioning of system behavior between components. In this work a complete description of the problem of simultaneous rate determination under conditions of mutual interference is developed and …

    mit Repository record for Kinetic analysis of leaching reactions in multi-component mineral systems (opens in a new tab)

  15. Next-generation, phasor-based distance relay with fault-path resistance immunity

    … distance relays, however, are plagued with problems caused by faults through a resistance. The fault-path resistance causes the apparent impedance determined by the distance relay to appear larger than the actual impedance between the relay location and the transmission line fault location. …

    vt Repository record for Next-generation, phasor-based distance relay with fault-path resistance immunity (opens in a new tab)

  16. Algorithms related to subgroups of the modular group

    … subgroups of the modular group PSL_2{Z} is a fundamental problem with applications to modular forms, in addition to its group-theoretic interest. While a lot of research has been done on the congruence subgroups of PSL_2{Z}, very little is known about noncongruence subgroups. The purpose of …

    lsu-thes Repository record for Algorithms related to subgroups of the modular group (opens in a new tab)

  17. Mathematical methods for non-intrusive load monitoring

    … Transform (DFT) of a discrete time signal is a fundamental problem in discrete-time signal processing. This thesis presents algorithms that use methods from number theory and algebra to exploit additional constraints about a signal to aid in the calculation of its DFT. First, an algorithm is …

    mit Repository record for Mathematical methods for non-intrusive load monitoring (opens in a new tab)

  18. Humanizing autonomy : social scientists' and engineers' futures for robotic cars

    … these systems are also fast and dangerous. The fundamental problem of getting robots to interact in the world will be getting them to do the "right thing" -- according to developers, users, and societies. But what is "right" is a matter of perspective, and there will be many ways to achieve any …

    mit Repository record for Humanizing autonomy : social scientists' and engineers' futures for robotic cars (opens in a new tab)

  19. Scalable subgraph representation learning through simplification

    Link prediction on graphs is a fundamental problem. Subgraph representation learning approaches (SGRLs), by transforming link prediction to graph classification on the subgraphs around the links, have achieved state-of-the-art performance in link prediction. However, SGRLs are computationally …

    uoit Repository record for Scalable subgraph representation learning through simplification (opens in a new tab)

  20. PERFORMANCE ESTIMATION AND SCHEDULING FOR PARALLEL PROGRAMS WITH CRITICAL SECTIONS

    A fundamental problem in multithreaded parallel programs is the partial serialization that is imposed due to the presence of mutual exclusion variables or critical sections. In this work we investigate a model that considers the threads consisting of an equal number L of functional blocks, where …

    siu-theses Repository record for PERFORMANCE ESTIMATION AND SCHEDULING FOR PARALLEL PROGRAMS WITH CRITICAL SECTIONS (opens in a new tab)

Page 1 of 12