Now showing items 14-33 of 35

    • 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 ...
    • Magnetic Resonance Imaging of the Brain 

      Hu, Xiaoping (Georgia Institute of Technology, 2012-10-12)
      Magnetic Resonance Imaging (MRI) has become a powerful, indispensable, and ubiquitously used methodology in neuroimaging. In particularly, functional magnetic resonance imaging (fMRI) and diffusion tensor imaging (DTI) ...
    • 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 ...
    • Mining Billion-Node Graphs: Patterns, Generators, and Tools 

      Faloutsos, Christos (Georgia Institute of Technology, 2011-04-08)
      What do graphs look like? How do they evolve over time? How to handle a graph with a billion nodes? We present a comprehensive list of static and temporal laws, and some recent observations on real graphs (like, e.g., ...
    • Modeling Rich Structured Data via Kernel Distribution Embeddings 

      Song, Le (Georgia Institute of Technology, 2011-03-25)
      Real world applications often produce a large volume of highly uncertain and complex data. Many of them have rich microscopic structures where each variable can take values on manifolds (e.g., camera rotations), combinatorial ...
    • 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 ...
    • Multicore-oblivious Algorithms 

      Chowdhury, Rezaul Alam (Georgia Institute of Technology, 2011-03-28)
      Multicores represent a paradigm shift in general-purpose computing away from the von Neumann model to a collection of cores on a chip communicating through a cache hierarchy under a shared memory. Designing efficient ...
    • New Approaches to Protein Functional Inference and Ligand Screening: Application to the Human Kinome 

      Skolnick, Jeffrey (Georgia Institute of Technology, 2011-01-14)
    • 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 ...
    • Open challenges in shape and animation processing 

      Rossignac, Jaroslaw R. (Georgia Institute of Technology, 2009-08-28)
      Jarek Rossignac (IC, http://www.gvu.gatech.edu/~jarek/) will present an overview of his recent research activities (with collaborators and students) and open challenges in shape and animation processing. These include: - ...
    • Optimization for Machine Learning: SMO-MKL and Smoothing Strategies 

      Vishwanathan, S. V. N. (Georgia Institute of Technology, 2011-04-15)
      Our objective is to train $p$-norm Multiple Kernel Learning (MKL) and, more generally, linear MKL regularised by the Bregman divergence, using the Sequential Minimal Optimization (SMO) algorithm. The SMO algorithm is simple, ...
    • PHAST: Hardware-Accelerated Shortest Path Trees 

      Delling, Daniel (Georgia Institute of Technology, 2011-02-25)
      We present a novel algorithm to solve the nonnegative single-source shortest path problem on road networks and other graphs with low highway dimension. After a quick preprocessing phase, we can compute all distances from ...
    • 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 ...
    • Spatial Stochastic Simulation of Polarization in Yeast Mating 

      Petzold, Linda (Georgia Institute of Technology, 2011-04-19)
      In microscopic systems formed by living cells, the small numbers of some reactant molecules can result in dynamical behavior that is discrete and stochastic rather than continuous and deterministic. Spatio-temporal gradients ...