15 citations · 18 across the 3 of their papers we have counts for
3 papers
cs.CG2010★ 3 cited
Reverse Nearest Neighbors Search in High Dimensions using Locality-Sensitive Hashing
David Arthur, Steve Y. Oudot
We investigate the problem of finding reverse nearest neighbors efficiently. Although provably good solutions exist for this problem in low or fixed dimensions, to this date the me…
cs.DS2009★ 15 cited
k-Means has Polynomial Smoothed Complexity
David Arthur, Bodo Manthey, Heiko Röglin
The k-means method is one of the most widely used clustering algorithms, drawing its popularity from its speed in practice. Recently, however, it was shown to have exponential wors…
cs.DS2009
Pricing strategies for viral marketing on Social Networks
David Arthur, Rajeev Motwani, Aneesh Sharma +1
We study the use of viral marketing strategies on social networks to maximize revenue from the sale of a single product. We propose a model in which the decision of a buyer to buy…