An Efficient Sum Query Algorithm for Distance-based Locally Dominating Functions
暂无分享,去创建一个
[1] Kasturi R. Varadarajan,et al. Geometric Approximation via Coresets , 2007 .
[2] Yufei Tao,et al. Efficient Top-k Indexing via General Reductions , 2016, PODS.
[3] Gábor Lugosi,et al. Concentration Inequalities - A Nonasymptotic Theory of Independence , 2013, Concentration Inequalities.
[4] Piotr Indyk,et al. Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality , 2012, Theory Comput..
[5] Jinhui Xu,et al. On Clustering Induced Voronoi Diagrams , 2017, SIAM J. Comput..
[6] Timothy M. Chan,et al. Optimal halfspace range reporting in three dimensions , 2009, SODA.
[7] Boris Aronov,et al. On approximating the depth and related problems , 2005, SODA '05.
[8] Sariel Har-Peled,et al. On coresets for k-means and k-median clustering , 2004, STOC '04.
[9] Michael Langberg,et al. A unified framework for approximating and clustering data , 2011, STOC.
[10] Ke Chen,et al. On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications , 2009, SIAM J. Comput..
[11] Yufei Tao,et al. Dynamic top-k range reporting in external memory , 2012, PODS '12.