Search
Now showing items 1-10 of 144
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 ...
Model-based user interface design by demonstration and by interview
(Georgia Institute of Technology, 1995-12)
Empirical studies of the value of algorithm animation in algorithm understanding
(Georgia Institute of Technology, 1993-08)
The fast multipole method at exascale
(Georgia Institute of Technology, 2013-11-26)
This thesis presents a top to bottom analysis on designing and implementing fast algorithms for current and future systems. We present new analysis, algorithmic techniques, and implementations of the Fast Multipole Method ...
Whitewash: Outsourcing Garbled Circuit Generation for Mobile Devices
(Georgia Institute of Technology, 2014)
Garbled circuits offer a powerful primitive for computation
on a user’s personal data while keeping that
data private. Despite recent improvements, constructing
and evaluating circuits of any useful size remains ...
Djasa : a language, environment and methodology for interaction design
(Georgia Institute of Technology, 1996-05)
High performance computing for irregular algorithms and applications with an emphasis on big data analytics
(Georgia Institute of Technology, 2014-03-31)
Irregular algorithms such as graph algorithms, sorting, and sparse matrix multiplication, present numerous programming challenges, including scalability, load balancing, and efficient memory utilization. In this age of Big ...
An empirical analysis of visible surface algorithms
(Georgia Institute of Technology, 1987)
Empirical studies of the value of algorithm animation in algorithm understanding
(Georgia Institute of Technology, 1993)
On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks
(Georgia Institute of Technology, 2002)
In this work, we study a fundamental tradeoff issue in designing dynamic
hash table (DHT) in peer-to-peer networks: the size of the routing table
v.s. the network diameter. It was observed in Ratnasamy et al. that
existing ...