TOC
2010
13 years 6 months ago
2010
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...
TOC
2010
13 years 6 months ago
2010
TNN
2010
13 years 6 months ago
2010
Nearest prototype methods are a successful trend of many pattern classification tasks. However, they present several shortcomings such as time response, noise sensitivity, and Manu...
TNN
2010
13 years 6 months ago
2010
In this paper, a novel real-time online network model is presented. It is derived from the hierarchical radial basis function (HRBF) model and it grows by automatically adding unit...
TNN
2010
13 years 6 months ago
2010
This paper provides a comprehensive framework for the state space approach to Boolean networks. First, it surveys the authors' recent work on the topic: Using semitensor produ...
TNN
2010
13 years 6 months ago
2010
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
TNN
2010
13 years 6 months ago
2010
The competitive layer model (CLM) can be described by an optimization problem. The problem can be further formulated by an energy function, called the CLM energy function, in the s...
TNN
2010
13 years 6 months ago
2010
In this paper, we present the evolution of adaptive resonance theory (ART) neural network architectures (classifiers) using a multiobjective optimization approach. In particular, w...
TNN
2010
13 years 6 months ago
2010
TNN
2010
13 years 6 months ago
2010
Clustering using the Hilbert Schmidt independence criterion (CLUHSIC) is a recent clustering algorithm that maximizes the dependence between cluster labels and data observations ac...