Serial decomposition of feedforward neural networks

[1]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

[2]  Shuzo Yajima,et al.  The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams , 1993, ISAAC.

[3]  G. Deco,et al.  An Information-Theoretic Approach to Neural Computing , 1997, Perspectives in Neural Computing.

[4]  Hiroshi Sawada,et al.  Minimization of binary decision diagrams based on exchanges of variables , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[5]  Zdzislaw Pawlak,et al.  Rough classification , 1984, Int. J. Hum. Comput. Stud..

[6]  George Cybenko,et al.  Approximation by superpositions of a sigmoidal function , 1989, Math. Control. Signals Syst..

[7]  Marek Karpinski,et al.  Polynomial bounds for VC dimension of sigmoidal neural networks , 1995, STOC '95.

[8]  David Haussler,et al.  Learning decision trees from random examples , 1988, COLT '88.

[9]  George Cybenko,et al.  Approximation by superpositions of a sigmoidal function , 1992, Math. Control. Signals Syst..

[10]  Henrik Gollee,et al.  Modular Neural Networks and Self-Decomposition , 1997 .

[11]  Henry Selvaraj,et al.  Balanced multilevel decomposition and its applications in FPGA-based synthesis , 1995 .

[12]  A. Sakurai,et al.  Tighter bounds of the VC-dimension of three layer networks , 1993 .

[13]  Eduardo Sontag.  VC dimension of neural networks , 1998 .

[14]  William G. Faris.  Shadows of the Mind: A Search for the Missing Science of Consciousness , 1997 .

[15]  Erkki Oja,et al.  Independent Component Analysis for Parallel Financial Time Series , 1998, International Conference on Neural Information Processing.

[16]  Venkatesan Muthukumar,et al.  Implementation of Large Neural Networks using Decomposition , 2002 .

[17]  Claude E. Shannon,et al.  A symbolic analysis of relay and switching circuits , 1938, Transactions of the American Institute of Electrical Engineers.

[18]  N. K. Bose,et al.  Neural Network Fundamentals with Graphs, Algorithms and Applications , 1995 .

[19]  Henry Selvaraj,et al.  Decomposition of Boolean Relations and Functions in Logic Synthesis and Data Analysis , 2000, Rough Sets and Current Trends in Computing.

[20]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.

[21]  S. Hawking.  A Brief History of Time: From the Big Bang to Black Holes , 1988 .

[22]  H. Niewiadomski,et al.  Decomposition and Argument Reduction of Neural Networks , 2003 .

[23]  Balas K. Natarajan,et al.  On learning sets and functions , 2004, Machine Learning.

[24]  Eduardo D. Sontag,et al.  Neural Networks with Quadratic VC Dimension , 1995, J. Comput. Syst. Sci..

[25]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[26]  J. Shearer,et al.  Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification , 1986, IEEE Transactions on Computers.

[27]  Fabio Somenzi,et al.  Variable ordering for binary decision diagrams , 1992, [1992] Proceedings The European Conference on Design Automation.

[28]  Erkki Oja,et al.  Independent component analysis: algorithms and applications , 2000, Neural Networks.

[29]  Rudy Moddemeijer.  A decomposition technique for modular neural networks , 2000 .

[30]  Xindong Wu,et al.  Lecture Notes in Machine Learning , 1994, Informatica.

[31]  Tadeusz Luba,et al.  Functional Decomposition and its Applications in Design of Digital Circuits and Machine Learning , 2001 .

[32]  Mikael Millberg,et al.  Implementation Of A Pulse Coupled Neural Network in FPGA , 2000, Int. J. Neural Syst..

[33]  Terrence L. Fine,et al.  Feedforward Neural Network Methodology , 1999, Information Science and Statistics.

[34]  Dexter Kozen,et al.  The Design and Analysis of Algorithms , 1991, Texts and Monographs in Computer Science.

[35]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[36]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[37]  Wei Wan,et al.  A new approach to the decomposition of incompletely specified multi-output functions based on graph coloring and local transformations and its application to FPGA mapping , 1992, Proceedings EURO-DAC '92: European Design Automation Conference.

[38]  Tadeusz Luba,et al.  Decomposition of multiple-valued functions , 1995, Proceedings 25th International Symposium on Multiple-Valued Logic.

[39]  Erkki Oja,et al.  Independent Component Analysis for Identification of Artifacts in Magnetoencephalographic Recordings , 1997, NIPS.

[40]  Thomas C. Bartee,et al.  Computer Design of Multiple-Output Logical Networks , 1961, IRE Trans. Electron. Comput..

[41]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[42]  Pierre Marchal,et al.  Field-programmable gate arrays , 1999, CACM.

[43]  Raymond L. Watrous.  A Comparison between Squared Error and Relative Entropy Metrics Using Several Optimization Algorithms , 1992, Complex Syst..

[44]  Eric B. Baum,et al.  Supervised Learning of Probability Distributions by Neural Networks , 1987, NIPS.

[45]  Masahiro Fujita,et al.  On variable ordering of binary decision diagrams for the application of multi-level logic synthesis , 1991, Proceedings of the European Conference on Design Automation..

[46]  Michael J. Flynn,et al.  Computer Organization and Architecture , 1978, Advanced Course: Operating Systems.

[47]  S. Lloyd.  Quantum-Mechanical Computers , 1995 .

[48]  Marek Perkowski,et al.  A new approach to the decomposition of incompletely specified multi-output functions based on graph coloring and local transformations and its application to FPGA mapping , 1992 .

[49]  H. Allen Curtis.  A Generalized Tree Circuit , 1961, JACM.

[50]  Malgorzata Marek-Sadowska,et al.  Decomposition of Multiple-Valued Relations , 1997, ISMVL.

[51]  R. Palmer,et al.  Finiteness Results for Sigmoidal "Neural" Networks , 1993 .

[52]  Nripendra N. Biswas,et al.  Minimization of Boolean Functions , 1971, IEEE Transactions on Computers.

[53]  Richard Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, ICCAD.

[54]  K. Appel,et al.  Every planar map is four colorable. Part II: Reducibility , 1977 .

[55]  S. Kosslyn,et al.  Why are What and Where Processed by Separate Cortical Visual Systems? A Computational Investigation , 1989, Journal of Cognitive Neuroscience.

[56]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[57]  Bernard Girau,et al.  FPNA: Interaction Between FPGA and Neural Computation , 2000, Int. J. Neural Syst..

[58]  Perambur S. Neelakanta,et al.  INFORMATION-THEORETIC ASPECTS of NEURAL NETWORKS , 1999 .

[59]  K. Appel,et al.  Every planar map is four colorable. Part I: Discharging , 1977 .

[60]  Wolfgang Maass,et al.  Neural Nets with Superlinear VC-Dimension , 1994, Neural Computation.

[61]  David Haussler,et al.  Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.

[62]  Jeffrey D. Smith,et al.  Design and Analysis of Algorithms , 2009, Lecture Notes in Computer Science.

[63]  Dudley,et al.  Real Analysis and Probability: Measurability: Borel Isomorphism and Analytic Sets , 2002 .

[64]  Tony R. Martinez,et al.  Digital Neural Networks , 1988, Proceedings of the 1988 IEEE International Conference on Systems, Man, and Cybernetics.