5 papers
A Community-Aware Framework for Influence Maximization with Explicit Accounting for Inter-Community Influence
Eliot W. Robson, Abhishek K. Umrawal
Influence Maximization (IM) seeks to identify a small set of seed nodes in a social network to maximize expected information spread under a diffusion model. While community-based a…
The Road to the Closest Point is Paved by Good Neighbors
Sariel Har-Peled, Benjamin Raichel, Eliot W. Robson
Given a set of points in , and a parameter , we present a new construction of a directed graph , of size $O…
Well-Separated Pairs Decomposition Revisited
Sariel Har-Peled, Benjamin Raichel, Eliot W. Robson
We revisit the notion of WSPD (i.e., well-separated pairs-decomposition), presenting a new construction of WSPD for any finite metric space, and show that it is asymptotically inst…
Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search
Jack Spalding-Jamieson, Eliot Wong Robson, Da Wei Zheng
For very large values of , we consider methods for fast -means clustering of massive datasets with points in high-dimensions (). All current practica…
Sparsifying Disk Intersection Graphs for Reliable Connectivity
Sariel Har-Peled, Eliot Wong Robson
The intersection graph induced by a set $\Disks$ of disks can be dense. It is thus natural to try and sparsify it, while preserving connectivity. Unfortunately, sparse graphs c…