Currently there is no effective pharmacological method for treating problem drinkers without having negative side effects. Although previous studies indicate that brief office technique has positive...
k-Means has Polynomial Smoothed Complexity (2009)
Arthur, David, Manthey, Bodo, Röglin, Heiko
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 worst-case running...
Finding Friends and Followers in Sub-linear Time (2009)
Arthur, David, Oudot, Steve, Sharma, Anneesh
The approximate Nearest Neighbor (NN) search problem asks to pre-process a given set of points $P$ in such a way that, given any query point $q$, one can retrieve a point in $P$ that is approximately...
Finding Friends and Followers in Sub-linear Time (2009)
Arthur, David, Oudot, Steve, Sharma, Anneesh
The approximate Nearest Neighbor (NN) search problem asks to pre-process a given set of points $P$ in such a way that, given any query point $q$, one can retrieve a point in $P$ that is approximately...
Finding Friends and Followers in Sub-linear Time (2009)
Arthur, David, Oudot, Steve, Sharma, Anneesh
The approximate Nearest Neighbor (NN) search problem asks to pre-process a given set of points $P$ in such a way that, given any query point $q$, one can retrieve a point in $P$ that is approximately...
Finding Friends and Followers in Sub-linear Time (2009)
Arthur, David, Oudot, Steve, Sharma, Anneesh
The approximate Nearest Neighbor (NN) search problem asks to pre-process a given set of points $P$ in such a way that, given any query point $q$, one can retrieve a point in $P$ that is approximately...