Sciweavers

11716 search results - page 192 / 2344
» Computable symbolic dynamics
Sort
View
SBCCI
2003
ACM
135views VLSI» more  SBCCI 2003»
15 years 11 months ago
Modeling a Reconfigurable System for Computing the FFT in Place via Rewriting-Logic
The growing adoption of reconfigurable architectures opens new implementation alternatives and creates new design challenges. In the case of dynamically reconfigurable architectur...
Mauricio Ayala-Rincón, Rodrigo B. Nogueira,...
KES
1998
Springer
15 years 10 months ago
Attractor systems and analog computation
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
Hava T. Siegelmann, Shmuel Fishman
IJON
2007
55views more  IJON 2007»
15 years 6 months ago
Short-term plasticity in a computational model of the tail-withdrawal circuit in Aplysia
The tail-withdrawal circuit of Aplysia provides a useful model system for investigating synaptic dynamics. Sensory neurons within the circuit manifest several forms of synaptic pl...
Douglas A. Baxter, John H. Byrne
TCS
2011
15 years 1 months ago
Dynamic normal forms and dynamic characteristic polynomial
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
Gudmund Skovbjerg Frandsen, Piotr Sankowski
KDD
2008
ACM
243views Data Mining» more  KDD 2008»
16 years 7 months ago
Permu-pattern: discovery of mutable permutation patterns with proximity constraint
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
Meng Hu, Jiong Yang, Wei Su