Sciweavers

3637 search results - page 11 / 728
» On Dynamic Bit-Probe Complexity
Sort
View
TCS
2011
13 years 2 months ago
Communication complexity and intrinsic universality in cellular automata
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rap...
NN
2000
Springer
150views Neural Networks» more  NN 2000»
13 years 7 months ago
Multi-step-ahead prediction using dynamic recurrent neural networks
A method for the development of empirical predictive models for complex processes is presented. The models are capable of performing accurate multi-step-ahead (MS) predictions, wh...
Alexander G. Parlos, Omar T. Rais, Amir F. Atiya
IVC
2002
143views more  IVC 2002»
13 years 7 months ago
Towards the automatic analysis of complex human body motions
The classification of human body motion is an integral component for the automatic interpretation of video sequences. In a first part we present an effective approach that uses mi...
Jens Rittscher, Andrew Blake, Stephen J. Roberts
SIAMREV
2010
110views more  SIAMREV 2010»
13 years 2 months ago
Complex Singularities and the Lorenz Attractor
The Lorenz attractor is one of the best known examples of applied mathematics. However, much of what is known about it is a result of numerical calculations and not of mathematica...
Divakar Viswanath, Sönmez Sahutoglu
TCOM
2010
112views more  TCOM 2010»
13 years 6 months ago
On further reduction of complexity in tree pruning based sphere search
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
Byonghyo Shim, Insung Kang