Sciweavers

5372 search results - page 151 / 1075
» complexity 2007
Sort
View
NN
2007
Springer
112views Neural Networks» more  NN 2007»
13 years 7 months ago
An augmented CRTRL for complex-valued recurrent neural networks
Real world processes with an “intensity” and “direction” component can be made complex by convenience of representation (vector fields, radar, sonar), and their processin...
Su Lee Goh, Danilo P. Mandic
COCOON
2007
Springer
14 years 2 months ago
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for classes of polynomials f that have too few partial derivatives for the techn...
Maurice J. Jansen, Kenneth W. Regan
ICC
2007
IEEE
136views Communications» more  ICC 2007»
14 years 2 months ago
Multiple-Symbol Differential Detection Based on Combinatorial Geometry
— In this paper, the application of combinatorial geometry to noncoherent multiple–symbol differential detection (MSDD) is considered. The resulting algorithm is referred to as...
Volker Pauli, Lutz H.-J. Lampe, Robert Schober, Ko...
ESANN
2003
13 years 9 months ago
Developmental pruning of synapses and category learning
After an initial peak, the number of synapses in mammalian cerebral cortex decreases in the formative period and throughout adult life. However, if synapses are taken to reflect ci...
Roberto Viviani, Manfred Spitzer
DATE
2007
IEEE
97views Hardware» more  DATE 2007»
14 years 2 months ago
What if you could design tomorrow's system today?
—This paper highlights a series of proven concepts aimed at facilitating the design of next generation systems. Practical system design examples are examined and provide insight ...
Neal Wingen