Now showing items 1-20 of 35

    • 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 ...
    • The Aha! Moment: From Data to Insight 

      Shahaf, Dafna (Georgia Institute of Technology, 2014-02-07)
      The amount of data in the world is increasing at incredible rates. Large-scale data has potential to transform almost every aspect of our world, from science to business; for this potential to be realized, we must turn ...
    • An analytical GPU performance model and a dynamic compilation system for CPU/GPU systems 

      Kim, Hyesoon (Georgia Institute of Technology, 2009-09-11)
    • 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 ...
    • 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 ...
    • 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 ...
    • Coordinate Sampling for Sublinear Optimization and Nearest Neighbor Search 

      Clarkson, Kenneth L. (Georgia Institute of Technology, 2011-04-22)
      I will describe randomized approximation algorithms for some classical problems of machine learning, where the algorithms have provable bounds that hold with high probability. Some of our algorithms are sublinear, that is, ...
    • Cyber Games 

      Vorobeychik, Yevgeniy (Georgia Institute of Technology, 2013-02-19)
      Over the last few years I have been working on game theoretic models of security, with a particular emphasis on issues salient in cyber security. In this talk I will give an overview of some of this work. I will first spend ...
    • 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 ...
    • 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)
    • 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 ...
    • Extending Hadoop to Support Binary-Input Applications 

      Hong, Bo (Georgia Institute of Technology, 2012-10-19)
      Many data-intensive applications naturally take multiple inputs, which is not well supported by some popular MapReduce implementations, such as Hadoop. In this talk, we present an extension of Hadoop to better support such ...
    • 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 ...
    • Graphical Models for the Internet 

      Smola, Alexander (Georgia Institute of Technology, 2011-04-29)
      In this talk I will present algorithms for performing large scale inference using Latent Dirichlet Allocation and a novel Cluster-Topic model to estimate user preferences and to group stories into coherent, topically ...
    • 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 ...
    • High-performance-computing challenges for heart simulations 

      Fenton, Flavio H. (Georgia Institute of Technology, 2012-08-31)
      The heart is an electro-mechanical system in which, under normal conditions, electrical waves propagate in a coordinated manner to initiate an efficient contraction. In pathologic states, propagation can destabilize and ...
    • How much (execution) time and energy does my algorithm cost? 

      Vuduc, Richard W. (Georgia Institute of Technology, 2012-08-24)
      When designing an algorithm or performance-tuning code, is time-efficiency (e.g., operations per second) the same as energy-efficiency (e.g., operations per Joule)? Why or why not? To answer these questions, we posit a ...
    • 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." ...
    • Load-Balanced Bonded Force Calculations on Anton 

      Franchetti, Franz (Georgia Institute of Technology, 2010-03-15)
      Spiral (www.spiral.net) 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 ...