Sciweavers

4315 search results - page 146 / 863
» Sorting in linear time
Sort
View
ESANN
2004
13 years 10 months ago
Linearization identification and an application to BSS using a SOM
The one-dimensional functional equation g(y(t)) = cg(z(t)) with known functions y and z and constant c is considered. The indeterminacies are calculated, and an algorithm for appro...
Fabian J. Theis, Elmar Wolfgang Lang
ICML
2010
IEEE
13 years 10 months ago
Learning the Linear Dynamical System with ASOS
We develop a new algorithm, based on EM, for learning the Linear Dynamical System model. Called the method of Approximated Second-Order Statistics (ASOS) our approach achieves dra...
James Martens
MOC
2000
68views more  MOC 2000»
13 years 9 months ago
Numerical approximations of one-dimensional linear conservation equations with discontinuous coefficients
Conservative linear equations arise in many areas of application, including continuum mechanics or high-frequency geometrical optics approximations. This kind of equation admits mo...
Laurent Gosse, François James
AUTOMATICA
2010
123views more  AUTOMATICA 2010»
13 years 7 months ago
On the computation of linear model predictive control laws
Finite-time optimal control problems with quadratic performance index for linear systems with linear constraints can be transformed into Quadratic Programs (QPs). Model Predictive ...
Francesco Borrelli, Mato Baotic, Jaroslav Pekar, G...
NAACL
2010
13 years 7 months ago
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
Carlos Gómez-Rodríguez, Marco Kuhlma...