✦ LIBER ✦

An upper bound on the performance of a novel feedforward perceptron equalizer

✍ Scribed by Pulford, G.W.; Kennedy, R.A.; Anderson, B.D.O.

Book ID: 114539868
Publisher: IEEE
Year: 1993
Tongue: English
Weight: 597 KB
Volume: 39
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.265500

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The performance of an upper bound on the

The performance of an upper bound on the fractional chromatic number of weighted graphs

✍ Ashwin Ganesan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 214 KB

Given a weighted graph G x , where (x(v) : v ∈ V ) is a non-negative, real-valued weight assigned to the vertices of G, let B(G x ) be an upper bound on the fractional chromatic number of the weighted graph G x ; so χ f (G x ) ≤ B(G x ). We consider a particular upper bound B resulting from a genera

An upper bound on the path number of a d

An upper bound on the path number of a digraph

✍ Richard C O'Brien 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 431 KB

An upper bound on the volume of discrete

An upper bound on the volume of discrete spheres

✍ Loeliger, H.-A. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 322 KB

Novel Cost-Sensitive Approach to Improve

Novel Cost-Sensitive Approach to Improve the Multilayer Perceptron Performance on Imbalanced Data

✍ Castro, C. L.; Braga, A. P. 📂 Article 📅 2013 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 596 KB

Improving an Upper Bound on the Stabilit

Improving an Upper Bound on the Stability Number of a Graph

✍ Carlos J. Luz 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 494 KB

An upper bound on the time complexity of

An upper bound on the time complexity of iterative-deepening-A*

✍ Brian G. Patrick; Mohammed Almulla; Monroe M. Newborn 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 704 KB