Now showing items 21-40 of 75

    • Exact polynomial system solving for robust geometric computation 

      Ouchi, Koji (Texas A&M University, 2007-04-25)
      I describe an exact method for computing roots of a system of multivariate polynomials with rational coefficients, called the rational univariate reduction. This method enables performance of exact algebraic computation ...
    • The existence of metrics of nonpositive curvature on the Brady-Krammer complexes for finite-type Artin groups 

      Choi, Woonjung (Texas A&M University, 2005-08-29)
      My dissertation focuses on the existence of metrics of non-positive curvature for the simplicial complexes constructed recently by Tom Brady and Daan Krammer for the braid groups and other Artin groups of finite type. ...
    • Finding conserved patterns in biological sequences, networks and genomes 

      Yang, Qingwu (2009-05-15)
      Biological patterns are widely used for identifying biologically interesting regions within macromolecules, classifying biological objects, predicting functions and studying evolution. Good pattern finding algorithms will ...
    • Goncarov Polynomials, Partition Lattices and Parking Sequences 

      Adeniran, Ayomikun Chukwuemeka (2020-06-01)
      Classical Goncarov polynomials arose in numerical analysis as a basis for the solutions of the Goncarov interpolation problem. These polynomials provide a natural algebraic tool in the enumerative theory of parking functions. ...
    • GPU programming for real-time watercolor simulation 

      Scott, Jessica Stacy (Texas A&M University, 2005-02-17)
      This thesis presents a method for combining GPU programming with traditional programming to create a fluid simulation based watercolor tool for artists. This application provides a graphical interface and a canvas ...
    • Graph searching and a generalized parking function 

      Kostic, Dimitrije Nenad (2009-05-15)
      Parking functions have been a focus of mathematical research since the mid-1970s. Various generalizations have been introduced since the mid-1990s and deep relationships between these and other areas of mathematics have ...
    • High Quality Compact Delay Test Generation 

      Wang, Zheng (2011-08-08)
      Delay testing is used to detect timing defects and ensure that a circuit meets its timing specifications. The growing need for delay testing is a result of the advances in deep submicron (DSM) semiconductor technology and ...
    • Implementing autonomous crowds in a computer generated feature film 

      Patterson, John Andre (Texas A&M University, 2006-04-12)
      The implementation of autonomous, flocking crowds of background characters in the feature film “Robots” is discussed. The techniques for obstacle avoidance and goal seeking are described. An overview of the implementation ...
    • Improved Algorithms for Discovery of Transcription Factor Binding Sites in DNA Sequences 

      Zhao, Xiaoyan (2012-02-14)
      Understanding the mechanisms that regulate gene expression is a major challenge in biology. One of the most important tasks in this challenge is to identify the transcription factors binding sites (TFBS) in DNA sequences. ...
    • Increasing TLB reach using TCAM cells 

      Kumar, Anuj (Texas A&M University, 2005-02-17)
      We propose dynamic aggregation of virtual tags in TLB to increase its coverage and improve the overall miss ratio during address translation. Dynamic aggregation exploits both the spatial and temporal locality inherent in ...
    • Information-based complexity applied to numerical transport theory 

      Yu, Fan (Texas A&M University. Libraries, 1992)
      In this work, we apply a recently developed theory, information-based complexity, to numerical transport theory. Two classes of information, cell-average information and point-evaluation information, and two popular ...
    • Kernelization and Enumeration: New Approaches to Solving Hard Problems 

      Meng, Jie (2011-08-08)
      NP-Hardness is a well-known theory to identify the hardness of computational problems. It is believed that NP-Hard problems are unlikely to admit polynomial-time algorithms. However since many NP-Hard problems are of ...
    • Layout optimization in ultra deep submicron VLSI design 

      Wu, Di (Texas A&M University, 2006-08-16)
      As fabrication technology keeps advancing, many deep submicron (DSM) effects have become increasingly evident and can no longer be ignored in Very Large Scale Integration (VLSI) design. In this dissertation, we study several ...
    • Measure-Driven Algorithm Design and Analysis: A New Approach for Solving NP-hard Problems 

      Liu, Yang (2010-10-12)
      NP-hard problems have numerous applications in various fields such as networks, computer systems, circuit design, etc. However, no efficient algorithms have been found for NP-hard problems. It has been commonly believed ...
    • Mechanism design for distributed task and resource allocation among self-interested agents in virtual organizations 

      He, Linli (Texas A&M University, 2007-09-17)
      The aggregate power of all resources on the Internet is enormous. The Internet can be viewed as a massive virtual organization that holds tremendous amounts of information and resources with different ownerships. However, ...
    • A method of Weil sum in multivariate quadratic cryptosystem 

      Harayama, Tomohiro (Texas A&M University, 2007-09-17)
      A new cryptanalytic application is proposed for a number theoretic tool Weil sum to the birthday attack against multivariate quadratic trapdoor function. This new customization of the birthday attack is developed by ...
    • Modeling high-genus surfaces 

      Srinivasan, Vinod (Texas A&M University, 2004-09-30)
      The goal of this research is to develop new, interactive methods for creating very high genus 2-manifold meshes. The various approaches investigated in this research can be categorized into two groups -- interactive methods, ...
    • Multi-writer consistency conditions for shared memory objects 

      Shao, Cheng (2009-05-15)
      Regularity is a shared memory consistency condition that has received considerable attention, notably in connection with quorum-based shared memory. Lamport's original definition of regularity assumed a single-writer model, ...
    • Multiprocessor Scheduling with Availability Constraints 

      Grigoriu, Liliana (2010-07-14)
      We consider the problem of scheduling a given set of tasks on multiple pro- cessors with predefined periods of unavailability, with the aim of minimizing the maximum completion time. Since this problem is strongly NP-hard, ...
    • A new graphical user interface for a 3D topological mesh modeler 

      Morris, David Victor (Texas A&M University, 2008-10-10)
      In this thesis, I present a new platform-independent, open source, intuitive graphical user interface for TopMod, an application designed for interacting with 3-dimensional manifold meshes represented by a Doubly Linked ...