2 citations · 6 across the 5 of their papers we have counts for
6 papers
Kernel Density Estimation through Density Constrained Near Neighbor Search
Moses Charikar, Michael Kapralov, Navid Nouri +1
In this paper we revisit the kernel density estimation problem: given a kernel and a dataset of points in high dimensional Euclidean space, prepare a data structure t…
Hashing-Based-Estimators for Kernel Density in High Dimensions
Moses Charikar, Paris Siminelakis
Given a set of points and a kernel , the Kernel Density Estimate at a point is defined as $\mathrm{KDE}_{P}(x)=\frac{1}{|P|}\sum_{…
Multi-Resolution Hashing for Fast Pairwise Summations
Moses Charikar, Paris Siminelakis
A basic computational primitive in the analysis of massive datasets is summing simple functions over a large number of objects. Modern applications pose an additional challenge in…
Product Measure Approximation of Symmetric Graph Properties
Dimitris Achlioptas, Paris Siminelakis
In the study of random structures we often face a trade-off between realism and tractability, the latter typically enabled by assuming some form of independence. In this work we in…
Navigability is a Robust Property
Dimitris Achlioptas, Paris Siminelakis
The Small World phenomenon has inspired researchers across a number of fields. A breakthrough in its understanding was made by Kleinberg who introduced Rank Based Augmentation (RBA…
On the Efficiency of Influence-and-Exploit Strategies for Revenue Maximization under Positive Externalities
Dimitris Fotakis, Paris Siminelakis
We study the problem of revenue maximization in the marketing model for social networks introduced by (Hartline, Mirrokni, Sundararajan, WWW '08). We restrict our attention to the…