A multilayer self-organizing model for convex-hull computation
暂无分享,去创建一个
[1] William F. Eddy,et al. A New Convex Hull Algorithm for Planar Sets , 1977, TOMS.
[2] Narendra Ahuja,et al. Gross motion planning—a survey , 1992, CSUR.
[3] Teuvo Kohonen,et al. Self-Organization and Associative Memory, Third Edition , 1989, Springer Series in Information Sciences.
[4] B. Gold,et al. A Comparison of Hamming and Hopfield Neural Nets for Pattern Classification , 1987 .
[5] Ray A. Jarvis,et al. On the Identification of the Convex Hull of a Finite Set of Points in the Plane , 1973, Inf. Process. Lett..
[6] S. Grossberg,et al. ART 2: self-organization of stable category recognition codes for analog input patterns. , 1987, Applied optics.
[7] David G. Kirkpatrick,et al. On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.
[8] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.
[9] Selim G. Akl,et al. A Fast Convex Hull Algorithm , 1978, Inf. Process. Lett..
[10] E. Wennmyr,et al. A convex hull algorithm for neural networks , 1989 .
[11] R. Lippmann,et al. An introduction to computing with neural nets , 1987, IEEE ASSP Magazine.
[12] Amitava Datta,et al. A dynamic neural net to compute convex hull , 1996, Neurocomputing.
[13] Donald R. Chand,et al. An Algorithm for Convex Polytopes , 1970, JACM.
[14] Sivan Toledo,et al. Applications of parametric searching in geometric optimization , 1992, SODA '92.
[15] Kishan G. Mehrotra,et al. Elements of artificial neural networks , 1996 .
[16] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[17] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..
[18] Yee Leung,et al. Neural networks for convex hull computation , 1997, IEEE Trans. Neural Networks.
[19] Sankar K. Pal,et al. A connectionist model for convex-hull of a planar set , 2000, Neural Networks.
[20] Kenneth L. Clarkson,et al. Fast linear expected-time algorithms for computing maxima and convex hulls , 1993, SODA '90.
[21] Christopher Rose,et al. Minimum distance automata in parallel networks for optimum classification , 1989, Neural Networks.
[22] Rae A. Earnshaw,et al. Theoretical Foundations of Computer Graphics and CAD , 1988, NATO ASI Series.
[23] Orly Yadid-Pecht,et al. A biologically-inspired improved MAXNET , 1995, IEEE Trans. Neural Networks.
[24] Yuen-Hsien Tseng,et al. On a Constant-Time, Low-Complexity Winner-Take-All Neural Network , 1995, IEEE Trans. Computers.
[25] Franco P. Preparata,et al. Approximation algorithms for convex hulls , 1982, CACM.
[26] Gerhard J. Woeginger,et al. Geometric Clusterings , 1991, J. Algorithms.
[27] Baruch Schieber,et al. Fast geometric approximation techniques and geometric embedding problems , 1989, SCG '89.
[28] Daisheng Luo,et al. Pattern Recognition and Image Processing , 1998 .
[29] Aaas News,et al. Book Reviews , 1893, Buffalo Medical and Surgical Journal.
[30] F. P. Preparata,et al. Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.
[31] Selim G. Akl,et al. Parallel computational geometry , 1992 .
[32] Sang-Hui Park,et al. Self-creating and organizing neural networks , 1994, IEEE Trans. Neural Networks.
[33] Josef Kittler,et al. Pattern recognition : a statistical approach , 1982 .
[34] Baruch Schieber,et al. Fast geometric approximation techniques and geometric embedding problems , 1989, SCG '89.
[35] Bruce W. Suter,et al. On a Magnitude Preserving Iterative MAXnet Algorithm , 1992, Neural Computation.