1536 search results - page 26 / 308 » Approximately Dominating Representatives |
TNN
1998
13 years 7 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
RTA
2010
Springer
13 years 9 months ago
2010
Springer
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
CAINE
2001
13 years 9 months ago
2001
In this paper, a new method for the approximation of discrete time state-affine systems is proposed. The method is based on the diagonalization of proposed generalized controllabi...
DAM
2011
13 years 2 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
QEST
2006
IEEE
14 years 1 months ago
2006
IEEE
New mobile access networks provide reasonable high bandwidth to allow true internet access. This paper models two dominant applications of those networks. One application, WAP, is...