Now showing items 1-20 of 35

    • Dependable direct solutions for linear systems using a little extra precision 

      Riedy, E. Jason (Georgia Institute of Technology, 2009-08-21)
      Solving a square linear system Ax=b often is considered a black box. It's supposed to "just work," and failures often are blamed on the original data or subtleties of floating-point. Now that we have an abundance of cheap ...
    • Blocked Plane Rotations for Band Reduction and Sparse SVD 

      Rajamanickam, Siva (Georgia Institute of Technology, 2009-08-26)
      With the success of Basic Linear Algebra Subroutines (BLAS) in using the memory efficiently, the algorithms with vector operations (BLAS2) have given way to algorithms with matrix operations (BLAS3). In some cases, BLAS3 ...
    • Open challenges in shape and animation processing 

      Rossignac, Jaroslaw R. (Georgia Institute of Technology, 2009-08-28)
      Jarek Rossignac (IC, will present an overview of his recent research activities (with collaborators and students) and open challenges in shape and animation processing. These include: - ...
    • An analytical GPU performance model and a dynamic compilation system for CPU/GPU systems 

      Kim, Hyesoon (Georgia Institute of Technology, 2009-09-11)
    • Multi-Scale Protein Modeling and Cellular Automata : Two Opportunities for Collaboration 

      Leamy, Michael (Georgia Institute of Technology, 2009-09-18)
      This talk will discuss two M&S research directions being pursued by the speaker in the GWW School of Mechanical Engineering. Both approaches are explicit and time-marching in nature, and should therefore be amenable to ...
    • Virus Quasispecies Assembly using Network Flows 

      Zelikovsky, Alexander (Georgia Institute of Technology, 2009-09-25)
      Understanding how the genomes of viruses mutate and evolve within infected individuals is critically important in epidemiology. In this talk I focus on optimization problems in sequence assembly for viruses based on 454 ...
    • Discovery of Mechanisms from Mathematical Modeling of DNA Microarray Data: Computational Prediction and Experimental Verification 

      Alter, Orly (Georgia Institute of Technology, 2010-02-16)
      Future discovery and control in biology and medicine will come from the mathematical modeling of large-scale molecular biological data, such as DNA microarray data, just as Kepler discovered the laws of planetary motion ...
    • Efficient High-Order Discontinuous Galerkin Methods for Fluid Flow Simulations 

      Shahbazi, Khosro (Georgia Institute of Technology, 2010-02-22)
    • Accurate Inference of Phylogenetic Relationships from Multi-locus Data 

      Nakhleh, Luay (Georgia Institute of Technology, 2010-03-09)
      Accurate inference of phylogenetic relationships of species, and understanding their relationships with gene trees are two central themes in molecular and evolutionary biology. Traditionally, a species tree is inferred by ...
    • Load-Balanced Bonded Force Calculations on Anton 

      Franchetti, Franz (Georgia Institute of Technology, 2010-03-15)
      Spiral ( is a program and hardware design generation system for linear transforms such as the discrete Fourier transform, discrete cosine transforms, filters, and others. We are currently extending Spiral ...
    • Fast Algorithms for Querying and Mining Large Graphs 

      Tong, Hanghang (Georgia Institute of Technology, 2010-03-16)
      Graphs appear in a wide range of settings and have posed a wealth of fascinating problems. In this talk, I will present our recent work on (1) querying (e.g., given a social network, how to measure the closeness between ...
    • Automating Topology Aware Task Mapping on Large Supercomputers 

      Bhatele, Abhinav S. (Georgia Institute of Technology, 2010-03-30)
      Parallel computing is entering the era of petascale machines. This era brings enormous computing power to us and new challenges to harness this power efficiently. Machines with hundreds of thousands of processors already ...
    • Composite Objective Optimization and Learning for Massive Datasets 

      Singer, Yoram (Georgia Institute of Technology, 2010-09-03)
      Composite objective optimization is concerned with the problem of minimizing a two-term objective function which consists of an empirical loss function and a regularization function. Application with massive datasets often ...
    • The Joy of PCA 

      Vempala, Santosh (Georgia Institute of Technology, 2010-09-17)
      Principal Component Analysis is the most widely used technique for high-dimensional or large data. For typical applications (nearest neighbor, clustering, learning), it is not hard to build examples on which PCA "fails." ...
    • Novel Applications of Graph Embedding Techniques 

      Bhowmick, Sanjukta (Georgia Institute of Technology, 2010-10-01)
      Force-directed graph embedding algorithms, like the Fruchterman-Reingold method, are typically used to generate aesthetically pleasing graph layouts. At a fundamental level, these algorithms are based on manipulating the ...
    • Gravity's Strongest Grip: A Computational Challenge 

      Shoemaker, Deirdre (Georgia Institute of Technology, 2010-10-22)
      Gravitational physics is entering a new era driven by observation that will begin once gravitational-wave interferometers make their first detections. In the universe, gravitational waves are produced during violent events ...
    • Metanumerical computing for partial differential equations: the Sundance project 

      Kirby, Robert C. (Georgia Institute of Technology, 2010-10-29)
      Metanumerical computing deals with computer programs that use abstract mathematical structure to manipulate, generate, and/or optimize compute-intensive numerical codes. This idea has gained popularity over the last decade ...
    • Sequences of Problems, Matrices, and Solutions 

      De Sturler, Eric (Georgia Institute of Technology, 2010-11-12)
      In a wide range of applications, we deal with long sequences of slowly changing matrices or large collections of related matrices and corresponding linear algebra problems. Such applications range from the optimal design ...
    • New Approaches to Protein Functional Inference and Ligand Screening: Application to the Human Kinome 

      Skolnick, Jeffrey (Georgia Institute of Technology, 2011-01-14)
    • The Exascale: Why and How 

      Keyes, David (Georgia Institute of Technology, 2011-02-11)
      Sustained floating-point computation rates on real applications, as tracked by the ACM Gordon Bell Prize, increased by three orders of magnitude from 1988 (1 Gigaflop/s) to 1998 (1 Teraflop/s), and by another three orders ...