Search
Now showing items 1-10 of 145
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 ...
Secure Outsourced Garbled Circuit Evaluation for Mobile Devices
(Georgia Institute of Technology, 2012)
Garbled circuits provide a powerful tool for jointly evaluating functions while preserving the privacy of each user’s inputs. While recent research
has made the use of this primitive more practical, such solutions generally ...
Evolution in Data Streams
(Georgia Institute of Technology, 2003)
Conventional data mining deals with static data stored on disk, for example, using the current state of a data warehouse. In addition, the data may be read muliple times to accomplish the mining task. Recently, the data ...
Message Ferries as Generalized Dominating Sets in Intermittently Connected Mobile Networks
(Georgia Institute of Technology, 2009)
Message ferrying is a technique for routing
data in wireless and mobile networks in which one or more
mobile nodes are tasked with storing and carrying data
between sources and destinations. To achieve connectivity
between ...
The Expectation Maximization Algorithm
(Georgia Institute of Technology, 2002)
This note represents my attempt at explaining the EM algorithm. This is just a slight variation on Tom Minka's tutorial, perhaps a little easier (or perhaps not). It includes a graphical example to provide some intuition.
A Clustering Algorithm to Discover Low and High Density Hyper-Rectangles in Subspaces of Multidimensional Data.
(Georgia Institute of Technology, 1999)
This paper presents a clustering algorithm to discover low and high density
regions in subspaces of multidimensional data for Data Mining applications.
High density regions generally refer to typical cases, whereas low ...
Image Mining: A New Approach for Data Mining
(Georgia Institute of Technology, 1998)
We introduce a new focus for data mining, which is concerned
with knowledge discovery in image databases. We expect all
aspects of data mining to be relevant to image mining but in
this first work we concentrate on the ...
Models of computation and algorithms
(Georgia Institute of Technology, 1982)
Core Selection Methods for Multicast Routing
(Georgia Institute of Technology, 1995)
Multicast routing is an important topic of both theoretical and practical
interest. Some recently-proposed multicast routing algorithms involve the
designation of one or more network nodes as the "center" of the routing ...
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 ...