96 search results - page 3 / 20 » A Kalman-like algorithm with no requirements for noise and i... |
CORR
2011
Springer
13 years 23 days ago
2011
Springer
Abstract. We present and discuss the results of an experimental analysis in the design of Boolean networks by means of genetic algorithms. A population of networks is evolved with ...
TMC
2010
13 years 4 months ago
2010
—Recent years have witnessed the deployments of wireless sensor networks in a class of mission-critical applications such as object detection and tracking. These applications oft...
CORR
2011
Springer
13 years 23 days ago
2011
Springer
In this paper we present clustering method is very sensitive to the initial center values ,requirements on the data set too high, and cannot handle noisy data the proposal method ...
ICDE
2008
IEEE
14 years 7 months ago
2008
IEEE
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
NIPS
2001
13 years 7 months ago
2001
We study the dynamics of a Hebbian ICA algorithm extracting a single non-Gaussian component from a high-dimensional Gaussian background. For both on-line and batch learning we fin...