Helly-Type Theorems in Property Testing
暂无分享,去创建一个
[1] Dana Ron. Property Testing: A Learning Theory Perspective , 2008, Found. Trends Mach. Learn..
[2] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[3] N. Alon,et al. Testing of Clustering , 2003, SIAM J. Discret. Math..
[4] M. Katchalski,et al. A problem of geometry in ⁿ , 1979 .
[5] Anil K. Jain,et al. Algorithms for Clustering Data , 1988 .
[6] Jürgen Eckhoff,et al. An Upper-Bound theorem for families of convex sets , 1985 .
[7] Nimrod Megiddo,et al. The Weighted Euclidean 1-Center Problem , 1983, Math. Oper. Res..
[8] M. Katchalski,et al. A Problem of Geometry in R n , 1979 .
[9] Artur Czumaj,et al. Property Testing in Computational Geometry , 2000, ESA.
[10] Oded Goldreich,et al. Combinatorial property testing (a survey) , 1997, Randomization Methods in Algorithm Design.
[11] Meir Katchalski,et al. On a conjecture of Danzer and Grünbaum , 1996 .
[12] Peter J. Rousseeuw,et al. Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .
[13] Branko Grünbaum,et al. Intersection properties of boxes in Rd , 1982, Comb..
[14] Artur Czumaj,et al. Property Testing with Geometric Queries , 2001, ESA.
[15] Gil Kalai,et al. Intersection patterns of convex sets , 1984 .
[16] Samir Khuller,et al. Algorithms for facility location problems with outliers , 2001, SODA '01.
[17] Noga Alon,et al. A Simple Proof of the Upper Bound Theorem , 1985, Eur. J. Comb..
[18] Meena Mahajan,et al. The planar k-means problem is NP-hard , 2012, Theor. Comput. Sci..
[19] Michael R. Anderberg,et al. Cluster Analysis for Applications , 1973 .