2 citations · 2 across the 12 of their papers we have counts for
6 papers · 1 filter
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…
A Pressure-Based Diffusion Model for Influence Maximization on Social Networks
Curt Stutsman, Eliot W. Robson, Abhishek K. Umrawal
In many real-world scenarios, an individual's local social network carries significant influence over the opinions they form and subsequently propagate. In this paper, we propose a…
Improving the average dilation of a metric graph by adding edges
Sariel Har-Peled, Eliot W. Robson
For a graph spanning a metric space, the dilation of a pair of points is the ratio of their distance in the shortest path graph metric to their distance in the metric space. Gi…
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…