Sciweavers

573 search results - page 72 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
NECO
2007
115views more  NECO 2007»
13 years 8 months ago
Training Recurrent Networks by Evolino
In recent years, gradient-based LSTM recurrent neural networks (RNNs) solved many previously RNN-unlearnable tasks. Sometimes, however, gradient information is of little use for t...
Jürgen Schmidhuber, Daan Wierstra, Matteo Gag...
AUTOMATICA
2007
75views more  AUTOMATICA 2007»
13 years 9 months ago
System theory for numerical analysis
Many numerical schemes can be suitably studied from a system theoretic point of view. This paper studies the relationship between the two disciplines, that is, numerical analysis ...
Kenji Kashima, Yutaka Yamamoto
MCS
2007
Springer
13 years 9 months ago
Delay-dependent stability analysis for uncertain neutral systems with time-varying delays
This paper investigates the stability of neutral delay-differential systems with mixed multiple time-varying delay arguments. Based on the Lyapunov functional method, and the rela...
Xin-Ge Liu, Min Wu, Ralph Martin, Mei-Lan Tang
SC
1994
ACM
14 years 1 months ago
A parallel formulation of interior point algorithms
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming LP problems. In this paper we describe a highly parallel ...
George Karypis, Anshul Gupta, Vipin Kumar
CINQ
2004
Springer
131views Database» more  CINQ 2004»
14 years 2 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...