5 search results - page 1 / 1 » Subspace identification of distributed, decomposable systems |
CDC
2009
IEEE
13 years 9 months ago
2009
IEEE
AIPS
1994
13 years 6 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
KDD
2005
ACM
13 years 10 months ago
2005
ACM
The increasing complexity of today’s systems makes fast and accurate failure detection essential for their use in mission-critical applications. Various monitoring methods provi...
BMCBI
2010
13 years 4 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
KDD
2012
ACM
11 years 7 months ago
2012
ACM
This paper introduces a novel image decomposition approach for an ensemble of correlated images, using low-rank and sparsity constraints. Each image is decomposed as a combination...