Over the last decade, we have seen a revolution in connectivity between computers, and a
resulting paradigm shift from centralized to highly distributed systems. With massive scale …

There are many methods for making a multicast protocol “reliable.” At one end of the
spectrum, a reliable multicast protocol might offer tomicity guarantees, such as all-or-nothing …

Given an undirected graph representing a network of processors, and a source node
containing a message that must be broadcast to all the nodes, find a scheme that …

A motion-based, correspondence-free technique or human gait recognition in monocular
video is presented. We contend that the planar dynamics of a walking person are encoded …

With the prevalence of social networks, it has become increasingly important to understand
their features and limitations. It has been observed that information spreads extremely fast in …

Social networks are an interesting class of graphs likely to become of increasing importance
in the future, not only theoretically, but also for its probable applications to ad hoc and …

We study the connection between the rate at which a rumor spreads throughout a graph and
the conductance of the graph--a standard measure of a graph's expansion properties. We …

In this paper, we address the problem of estimating the maximal value over a sensor
network using wireless links between them. We introduce two heuristic algorithms and …

We show that if a connected graph with n nodes has conductance φ then rumour spreading,
also known as randomized broadcast, successfully broadcasts a message within~ O (φ-1• …

Online social networks are a dominant medium in everyday life to stay in contact with friends
and to share information. In Twitter, users can connect with other users by following them …