Search
Now showing items 1-8 of 8
Parallel algorithms for direct blood flow simulations
(Georgia Institute of Technology, 2012-02-21)
Fluid mechanics of blood can be well approximated by a mixture model of a Newtonian fluid and deformable particles representing the red blood cells. Experimental and theoretical evidence suggests that the deformation and ...
Efficient algorithms for geometric pattern matching
(Georgia Institute of Technology, 1999)
Multi-tree Monte Carlo methods for fast, scalable machine learning
(Georgia Institute of Technology, 2009-01-09)
As modern applications of machine learning and data mining are forced to deal with ever more massive quantities of data, practitioners quickly run into difficulty with the scalability of even the most basic and fundamental ...
Algorithms for large graphs
(Georgia Institute of Technology, 2010-07-01)
Some approximation algorithms for multi-agent systems
(Georgia Institute of Technology, 2011-08-29)
This thesis makes a number of contributions to the theory of approximation algorithm design for multi-agent systems. In particular, we focus on two research directions. The first direction is to generalize the classical ...
Graph and geometric algorithms on distributed networks and databases
(Georgia Institute of Technology, 2011-05-16)
In this thesis, we study the power and limit of algorithms on various models, aiming at applications in distributed networks and databases.
In distributed networks, graph algorithms are fundamental to many applications. ...
Algorithm design on multicore processors for massive-data analysis
(Georgia Institute of Technology, 2010-06-28)
Analyzing massive-data sets and streams is computationally very challenging. Data sets in
systems biology, network analysis and security use network abstraction to construct large-scale
graphs. Graph algorithms such as ...
Worst-case robot navigation in deterministic environments
(Georgia Institute of Technology, 2009-12-02)
We design and analyze algorithms for the following two robot navigation problems:
1. TARGET SEARCH. Given a robot located at a point s in the plane, how will a robot navigate to a goal t in the presence of unknown
obstacles ...