Browsing Computational Science and Engineering Seminar Series by Title
Now showing items 1433 of 35

Fast Algorithms for Querying and Mining Large Graphs
(Georgia Institute of Technology, 20100316)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
(Georgia Institute of Technology, 20110429)In this talk I will present algorithms for performing large scale inference using Latent Dirichlet Allocation and a novel ClusterTopic model to estimate user preferences and to group stories into coherent, topically ... 
Gravity's Strongest Grip: A Computational Challenge
(Georgia Institute of Technology, 20101022)Gravitational physics is entering a new era driven by observation that will begin once gravitationalwave interferometers make their first detections. In the universe, gravitational waves are produced during violent events ... 
Highperformancecomputing challenges for heart simulations
(Georgia Institute of Technology, 20120831)The heart is an electromechanical 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?
(Georgia Institute of Technology, 20120824)When designing an algorithm or performancetuning code, is timeefficiency (e.g., operations per second) the same as energyefficiency (e.g., operations per Joule)? Why or why not? To answer these questions, we posit a ... 
The Joy of PCA
(Georgia Institute of Technology, 20100917)Principal Component Analysis is the most widely used technique for highdimensional or large data. For typical applications (nearest neighbor, clustering, learning), it is not hard to build examples on which PCA "fails." ... 
LoadBalanced Bonded Force Calculations on Anton
(Georgia Institute of Technology, 20100315)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
(Georgia Institute of Technology, 20121012)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
(Georgia Institute of Technology, 20101029)Metanumerical computing deals with computer programs that use abstract mathematical structure to manipulate, generate, and/or optimize computeintensive numerical codes. This idea has gained popularity over the last decade ... 
Mining BillionNode Graphs: Patterns, Generators, and Tools
(Georgia Institute of Technology, 20110408)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
(Georgia Institute of Technology, 20110325)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 ... 
MultiScale Protein Modeling and Cellular Automata : Two Opportunities for Collaboration
(Georgia Institute of Technology, 20090918)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 timemarching in nature, and should therefore be amenable to ... 
Multicoreoblivious Algorithms
(Georgia Institute of Technology, 20110328)Multicores represent a paradigm shift in generalpurpose 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
(Georgia Institute of Technology, 20110114) 
Novel Applications of Graph Embedding Techniques
(Georgia Institute of Technology, 20101001)Forcedirected graph embedding algorithms, like the FruchtermanReingold 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
(Georgia Institute of Technology, 20090828)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: SMOMKL and Smoothing Strategies
(Georgia Institute of Technology, 20110415)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: HardwareAccelerated Shortest Path Trees
(Georgia Institute of Technology, 20110225)We present a novel algorithm to solve the nonnegative singlesource 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
(Georgia Institute of Technology, 20101112)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
(Georgia Institute of Technology, 20110419)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. Spatiotemporal gradients ...