Now showing items 966-985 of 1071

    • Text Mining Biomedical Literature for Genomic Knowledge Discovery 

      Liu, Ying (Georgia Institute of Technology, 2005-07-20)
      The last decade has been marked by unprecedented growth in both the production of biomedical data and the amount of published literature discussing it. Almost every known or postulated piece of information pertaining to ...
    • The average of a set of compatible curves and surfaces 

      Sati, Mukul (Georgia Institute of Technology, 2019-05-21)
      The proposed thesis focuses on providing definitions, closed-form expressions and algorithmic solutions for computing averages of sets of shapes and associated standard deviation fields. By shapes, we mean lines, planes, ...
    • The complexity of expansion problems 

      Louis, Anand (Georgia Institute of Technology, 2014-06-26)
      Graph-partitioning problems are a central topic of research in the study of algorithms and complexity theory. They are of interest to theoreticians with connections to error correcting codes, sampling algorithms, metric ...
    • The Complexity of Extended Formulations 

      Huq, Arefin (Georgia Institute of Technology, 2016-05-13)
      Combinatorial optimization plays a central role in complexity theory, operations research, and algorithms. Extended formulations give a powerful approach to solve combinatorial optimization problems: if one can find a ...
    • The economics of internet peering interconnections 

      Lodhi, Aemen Hassaan (Georgia Institute of Technology, 2014-11-17)
      The Internet at the interdomain level is a complex network of approximately 50,000 Autonomous Systems (ASes). ASes interconnect through two types of links: (a) transit (customer-provider) and (b) peering links. Recent ...
    • The effects of bias on sampling algorithms and combinatorial objects 

      Miracle, Sarah (Georgia Institute of Technology, 2015-04-03)
      Markov chains are algorithms that can provide critical information from exponentially large sets efficiently through random sampling. These algorithms are ubiquitous across numerous scientific and engineering disciplines, ...
    • The fast multipole method at exascale 

      Chandramowlishwaran, Aparna (Georgia Institute of Technology, 2013-11-26)
      This thesis presents a top to bottom analysis on designing and implementing fast algorithms for current and future systems. We present new analysis, algorithmic techniques, and implementations of the Fast Multipole Method ...
    • The hourglass effect in source-target dependency networks 

      Sabrin, Kaeser M. (Georgia Institute of Technology, 2018-11-13)
      Many hierarchically modular systems are structured in a way that resembles the shape of an hourglass: the system generates many outputs from many inputs through a relatively small number of intermediate modules that are ...
    • The internet of living things: Enabling increased information flow in dog—human interactions 

      Alcaidinho, Joelle Marie (Georgia Institute of Technology, 2017-04-25)
      The human–canine relationship is one of the oldest relationships between a hu- man and an animal. Even with this longevity and unique living arrangement, there is still a great deal that we don’t know about our dogs. What ...
    • The role of copyright in online creative communities: law, norms, and policy 

      Fiesler, Casey (Georgia Institute of Technology, 2015-07-23)
      Many sources of rules govern our interactions with technology and our behavior online—law, ethical guidelines, community norms, website policies—and they do not always agree. This is particularly true in the context of ...
    • The roles of allocentric representations in autonomous local navigation 

      Ta Huynh, Duy Nguyen (Georgia Institute of Technology, 2015-02-20)
      In this thesis, I study the computational advantages of the allocentric represen- tation as compared to the egocentric representation for autonomous local navigation. Whereas in the allocentric framework, all variables of ...
    • Theoretical Aspects of Randomization in Computation 

      Vishnoi, Nisheeth Kumar (Georgia Institute of Technology, 2004-07-12)
      Randomness has proved to be a powerful tool in all of computation. It is pervasive in areas such as networking, machine learning, computer graphics, optimization, computational number theory and is "necessary" for cryptography. ...
    • Theory and applications of data hiding in still images 

      Alturki, Faisal (Georgia Institute of Technology, 2001-05)
    • Three methods of detail-preserving contrast reduction for displayed images 

      Tumblin, John Erwin (Jack) (Georgia Institute of Technology, 1999-12)
    • Throughput and Fairness Considerations in Overlay Networks for Content Distribution 

      Karbhari, Pradnya (Georgia Institute of Technology, 2005-08-26)
      The Internet has been designed as a best-effort network, which does not provide any additional services to applications using the network. Overlay networks, which form an application layer network on top of the underlying ...
    • Tightening and blending subject to set-theoretic constraints 

      Williams, Jason Daniel (Georgia Institute of Technology, 2012-05-17)
      Our work applies techniques for blending and tightening solid shapes represented by sets. We require that the output contain one set and exclude a second set, and then we optimize the boundary separating the two sets. ...
    • Time-optimal sampling-based motion planning for manipulators with acceleration limits 

      Kunz, Tobias (Georgia Institute of Technology, 2015-04-07)
      Robot actuators have physical limitations in how fast they can change their velocity. The more accurately planning algorithms consider these limitations, the better the robot is able to perform. Sampling-based algorithms ...
    • Topology Control of Volumetric Data 

      Vanderhyde, James (Georgia Institute of Technology, 2007-07-06)
      Three-dimensional scans and other volumetric data sources often result in representations that are more complex topologically than the original model. The extraneous critical points, handles, and components are called ...
    • Toward a formalism for the automation of neural network construction and processing control 

      Czuchry, Andrew J., Jr. (Georgia Institute of Technology, 1993-08)
    • Toward accurate and efficient outlier detection in high dimensional and large data sets 

      Nguyen, Minh Quoc (Georgia Institute of Technology, 2010-04-22)
      An efficient method to compute local density-based outliers in high dimensional data was proposed. In our work, we have shown that this type of outlier is present even in any subset of the dataset. This property is used ...