67 citations · 105 across the 13 of their papers we have counts for
14 papers
Fast Approximate Matching of Cell-Phone Videos for Robust Background Subtraction
Raffay Hamid, Atish Das Sarma, Dennis DeCoste +1
We identify a novel instance of the background subtraction problem that focuses on extracting near-field foreground objects captured using handheld cameras. Given two user-generate…
Distributed Computation of Sparse Cuts
Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
Finding sparse cuts is an important tool in analyzing large-scale distributed networks such as the Internet and Peer-to-Peer networks, as well as large-scale graphs such as the web…
Distributed Random Walks
Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan +1
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we foc…
Dense Subgraphs on Dynamic Networks
Atish Das Sarma, Ashwin Lall, Danupon Nanongkai +1
In distributed networks, it is often useful for the nodes to be aware of dense subgraphs, e.g., such a dense subgraph could reveal dense subtructures in otherwise sparse graphs (e.…
Fast Distributed PageRank Computation
Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan +1
Over the last decade, PageRank has gained importance in a wide range of applications and domains, ever since it first proved to be effective in determining node importance in large…
Fast Distributed Computation in Dynamic Networks via Random Walks
Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
The paper investigates efficient distributed computation in dynamic networks in which the network topology changes (arbitrarily) from round to round. Our first contribution is a ri…