NDLTD logo NDLTD Union Catalog and Global ETD Search

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 23 for “"Computer science--Mathematics"”.

  1. Data-Driven Methods for Low-Energy Nuclear Theory

    Fox, Jordan M.R.2023

    … have been developed by the field of data science; these are at the intersection of computer science,mathematics, and statistics. When applied to a domain science like nuclear physics, especially with the goalof deepening scientific insight, data-driven methods form a core pillar of the …

    claremont Repository record

  2. Lower Bounds and Algorithms for Searching Networks

    Xue, YuanFaculty of Graduate Studies and Research, University of Regina2019

    … graph searching has recently gained interest in computer science, mathematics, and physics. This thesis provides new results on two graph search models, namely fast searching and the zero-visibility cops and robber model. Given a graph that contains an invisible fugitive, the fast searching …

    regina Repository record

  3. Character extraction from ancient Chinese stele using discrete cosine transform

    Ueno, Toshiaki

    … the Tang dynasty of China. We will be applying computer aided bibliotics to compare the characters in Ji Zi Sheng Jiao Xu and ones in other texts. Thus, we will be extracting hundreds of characters from digitized ink-rubbings of Chinese steles. This paper suggests that application of the DCT is …

    eastern-wash Repository record

  4. Studying FAQs Through a Magnifying Lens: New Results in Theory and Practice

    Mani Jayaraman, Sai VikneshwarState University of New York at Buffalo2025

    Ph.D.

    buffalo Repository record

  5. Individual and Social Learning: An Implementation of Bounded Rationality from First Principles

    Palmer, Nathan Michael2015

    gmu

  6. Practical Lattice-Based Zero-Knowledge Proof Systems

    Seiler, GregorETH Zurich2022

    ethz Repository record

  7. Computer Solution to Inverse Problems of Elliptic Form: V²U(x,y) = g(a,U,x,y)

    Jeter, Frederick Alvin

    portland-state Repository record

  8. A platform for practical homomorphic encryption in neural network classification : a thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy (Ph.D.) in Information Technology, Massey University

    Baryalai, Mehmood2021

    massey

  9. Analysis of scanning in dual offset reflector antennas and the bifocal system

    Rappaport, Carey MilfordMassachusetts Institute of Technology1982

    … Technology, Dept. of Electrical Engineering and Computer Science; and, (B.S.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1982.

    mit Repository record

  10. A Software Framework for Bayesian Uncertainty Quantification, Optimization, and Reinforcement Learning

    Wälchli, Daniel ThomasETH Zurich2024

    ethz Repository record

  11. Toward abstractive multi-document summarization using submodular function-based framework, sentence compression and merging

    Tanvee, Moin Mahmud, University of Lethbridge. Faculty of Arts and Science2016

    lethbridge

  12. Algorithms for Hermitian Eigenproblems and Applications in Quantum Chemistry and Machine Learning

    Sobczyk, AleksandrosETH Zurich2025

    ethz Repository record

  13. Various pushing methods on grid graphs

    Wang, Jiaxin2019

    This thesis describes algorithms for determining if a grid of switches can be turned into all-off state from any initial configuration by various methods of activation operation (push). Among these push methods, besides the regular "+" push, "+" push with no center, "X" push, "X" push with no …

    wvu Repository record

  14. Representing plans under uncertainty: A logic of time, chance, and action

    Haddawy, Peter FahridUniversity of Illinois at Urbana-Champaign2011

    As the limitations of traditional AI plan representations have become apparent, researchers have turned to temporal logic as one means of providing rich languages for structuring planning knowledge. But these languages lack the ability to represent uncertainty, as well as lacking any kind of link …

    uiuc Repository record

  15. Accelerated clustering through locality-sensitive hashing

    Kishore, ShaunakMassachusetts Institute of Technology2012

    We obtain improved running times for two algorithms for clustering data: the expectation-maximization (EM) algorithm and Lloyd's algorithm. The EM algorithm is a heuristic for finding a mixture of k normal distributions in Rd that maximizes the probability of drawing n given data points. Lloyd's …

    mit Repository record

  16. Coloring clique hypergraphs

    Poon, Hoifung2019

    Let G = (V, E) be a simple graph. The clique hypergraph of G, denoted as CH( G), has V as its set of vertices, and the maximal cliques as its hyperedges. Let Sk be a set of k colors. A map c : V Sk is a proper k-coloring for CH(G) if any maximal clique of G with at least two vertices receives at …

    wvu Repository record

  17. Generalized nowhere zero flow

    Chen, Jingjing2019

    Let G be an undirected graph, A be an (additive) abelian group and A* = A - {lcub}0{rcub}. A graph G is A-connected if G has an orientation D(G) such that for every function b : V(G ) A satisfying Sv∈VG b(v) = 0, there is a function f : E(G) A* such that at each vertex v ∈ V(G), …

    wvu Repository record

  18. Methods for Computing Genus Distribution Using Double-Rooted Graphs

    Khan, Imran Farid2012

    This thesis develops general methods for computing the genus distribution of various types of graph families, using the concept of double-rooted graphs, which are defined to be graphs with two vertices designated as roots (the methods developed in this dissertation are limited to the cases where …

    columbia-diss Repository record

  19. Various Approximate Methods to Measure the Uniformity of Quasirandom Sequences

    2023

    In many Monte Carlo applications, one can substitute the use of pseudorandom numbers with quasirandom numbers and achieve improved convergence. This is because quasirandom numbers are more uniform than pseudorandom numbers. The most common measure of that uniformity is the star discrepancy. In …

    fsu-retro

  20. Verificación formal en ACL2 del algoritmo de Buchberger

    Medina Bulo, María Inmaculada2003

    ACL2 is a computational logic, an automated reasoning system and an applicative programming language, a subset of COMMON LISP, based in pure lambda-calculus. It was developed in the University of Texas at Austin (USA) and is based in an untyped quantifier-free first-order logic of total recursive …

    cadiz Repository record

Page 1 of 2