2.9k citations
- Research!America (United States)US6 papers
- Stanford UniversityUS5 papers
- University of PennsylvaniaUS5 papers
- Cornell UniversityUS4 papers
- Microsoft (United States)US4 papers
- Google (United States)US3 papers
- IBM (United States)US3 papers
- University of AlbertaCA3 papers
- University of CambridgeGB3 papers
- University of Illinois Urbana-ChampaignUS3 papers
- University of Southern CaliforniaUS3 papers
- Yahoo (Spain)ES3 papers
4 papers · 1 filter
Plug-and-play dual-tree algorithm runtime analysis
Ryan R. Curtin, Dongryeol Lee, William B. March +1
Numerous machine learning algorithms contain pairwise statistical problems at their core---that is, tasks that require computations over all pairs of input points if implemented na…
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Rafael C. S. Schouery +2
We give an asymptotic approximation scheme (APTAS) for the problem of packing a set of circles into a minimum number of unit square bins. To obtain rational solutions, we use augme…
SHALE: An Efficient Algorithm for Allocation of Guaranteed Display Advertising
Vijay Bharadwaj, Peiji Chen, Wenjing Ma +5
Motivated by the problem of optimizing allocation in guaranteed display advertising, we develop an efficient, lightweight method of generating a compact {\em allocation plan} that…
Empirical Comparison of Algorithms for Network Community Detection
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses…