The following pages link to (Q3996586):
Displaying 47 items.
- On testing monomials in multivariate polynomials (Q391220) (← links)
- Methods for pattern selection, class-specific feature selection and classification for automated learning (Q461118) (← links)
- Logic in a dynamic brain (Q535582) (← links)
- Unbounded-error quantum query complexity (Q638526) (← links)
- Lyndon + Christoffel = digitally convex (Q834259) (← links)
- Two-layer contractive encodings for learning stable nonlinear features (Q890731) (← links)
- Introduction to computation and learning in artificial neural networks (Q914410) (← links)
- Perceptrons revisited (Q917263) (← links)
- Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
- Monotone circuits for monotone weighted threshold functions (Q1044746) (← links)
- Neural networks for control systems - a survey (Q1195800) (← links)
- SC-net: A hybrid connectionist, symbolic system (Q1260951) (← links)
- On the computational power of depth-2 circuits with threshold and modulo gates (Q1269909) (← links)
- A lower bound for perceptrons and an oracle separation of the \(PP^{PH}\) hierarchy (Q1271610) (← links)
- Broadening the tests of learning models (Q1293908) (← links)
- On the perceptron learning algorithm on data with high precision (Q1329165) (← links)
- On the degree of Boolean functions as real polynomials (Q1346612) (← links)
- Geometric sets of low information content (Q1351460) (← links)
- Normal vector and winding number in 2D digital images with their application for hole detection (Q1402711) (← links)
- Thirteen theorems in search of the truth (Q1839180) (← links)
- Unifying metric approach to the triple parity. (Q1852850) (← links)
- On optimal pairwise linear classifiers for normal distributions: The \(d\)-dimensional case (Q1856628) (← links)
- Complexity of perceptron recognition for a class of geometric patterns. (Q1874386) (← links)
- Logic programs and connectionist networks (Q1884268) (← links)
- Average case quantum lower bounds for computing the Boolean mean (Q1888378) (← links)
- Comparison of learning and generalization capabilities of the Kak and the backpropagation algorithms (Q1894264) (← links)
- Classification by polynomial surfaces (Q1897355) (← links)
- Arthur-Merlin games in Boolean decision trees (Q1961380) (← links)
- An asymptotically tight bound on the number of relevant variables in a bounded degree Boolean function (Q2003766) (← links)
- Fundamentals of recurrent neural network (RNN) and long short-term memory (LSTM) network (Q2116251) (← links)
- Challenges in Markov chain Monte Carlo for Bayesian neural networks (Q2163079) (← links)
- Boolean constant degree functions on the slice are juntas (Q2329200) (← links)
- Integer representations towards efficient counting in the bit probe model (Q2447536) (← links)
- A multiview approach for intelligent data analysis based on data operators (Q2465961) (← links)
- Relativized counting classes: Relations among thresholds, parity, and mods (Q2638771) (← links)
- A note on the complex and bicomplex valued neural networks (Q2698148) (← links)
- Correlation Between Eigenvalue Spectra and Dynamics of Neural Networks (Q3399367) (← links)
- The parts and the whole: inquiring how the interaction of simple subsystems generates complexity (Q3423740) (← links)
- Eluding oblivion with smart stochastic selection of synaptic updates (Q3531620) (← links)
- Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks (Q4638064) (← links)
- (Q4969154) (← links)
- Fooling Polytopes (Q5066946) (← links)
- (Q5091179) (← links)
- (Q5149237) (← links)
- Learning algorithms of layered neural networks via extended Kalman filters (Q5203710) (← links)
- Combinatorial View of Digital Convexity (Q5458874) (← links)
- Approximate blocked Gibbs sampling for Bayesian neural networks (Q6063143) (← links)
