Sciweavers

6045 search results - page 271 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
SCL
2008
105views more  SCL 2008»
15 years 7 months ago
Computation of nonlinear balanced realization and model reduction based on Taylor series expansion
In this paper a computational algorithm for nonlinear balanced realization and model reduction based on Taylor series expansion is proposed. This algorithm requires recursive comp...
Kenji Fujimoto, Daisuke Tsubakino
NIPS
2003
15 years 8 months ago
Information Dynamics and Emergent Computation in Recurrent Circuits of Spiking Neurons
We employ an efficient method using Bayesian and linear classifiers for analyzing the dynamics of information in high-dimensional states of generic cortical microcircuit models....
Thomas Natschläger, Wolfgang Maass
AMC
2005
105views more  AMC 2005»
15 years 7 months ago
Symbolic computing of nonlinear observable and observer forms
Observer design for highly nonlinear dynamics is an important issue, particularly when the locally observable dynamics are not linearly observable. In such circumstances the abili...
Harry G. Kwatny, Bor-Chin Chang
FOCS
1990
IEEE
15 years 11 months ago
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
Noga Alon, Nimrod Megiddo
CIE
2008
Springer
15 years 9 months ago
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
Marcin Jurdzinski, Rahul Savani