The Computational Complexity of Densest Region Detection
暂无分享,去创建一个
[1] Peter L. Bartlett,et al. Neural Network Learning - Theoretical Foundations , 1999 .
[2] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[3] Bernd Carl. On a characterization of operators from lq into a Banach space of type p with some applications to eigenvalue problems , 1982 .
[4] Shai Ben-David,et al. On the difficulty of approximately maximizing agreements , 2000, J. Comput. Syst. Sci..
[5] Y. Chien,et al. Pattern classification and scene analysis , 1974 .
[6] Nimrod Megiddo,et al. On the complexity of polyhedral separability , 1988, Discret. Comput. Geom..
[7] Hans Ulrich Simon,et al. Efficient Learning of Linear Perceptrons , 2000, NIPS.
[8] Peter E. Hart,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.
[9] S. Ben-David,et al. Eecient Learning of Linear Perceptrons , 2000 .
[10] Shai Ben-David,et al. Learning Distributions by Their Density Levels: A Paradigm for Learning without a Teacher , 1997, J. Comput. Syst. Sci..
[11] G. Pisier. Remarques sur un résultat non publié de B. Maurey , 1981 .
[12] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[13] Franco P. Preparata,et al. The Densest Hemisphere Problem , 1978, Theor. Comput. Sci..
[14] R. Dudley. Universal Donsker Classes and Metric Entropy , 1987 .