Sciweavers

2210 search results - page 153 / 442
» Information complexity of neural networks
Sort
View
IWANN
2005
Springer
16 years 9 hour ago
Manifold Constrained Finite Gaussian Mixtures
In many practical applications, the data is organized along a manifold of lower dimension than the dimension of the embedding space. This additional information can be used when le...
Cédric Archambeau, Michel Verleysen
KBS
2002
150views more  KBS 2002»
15 years 6 months ago
When eigenfaces are combined with wavelets
This paper presents a novel and interesting combination of wavelet techniques and eigenfaces to extract features for face recognition. Eigenfaces reduce the dimensions of face vec...
Li Bai, Yihui Liu
PERCOM
2005
ACM
16 years 6 months ago
Exploiting Information Relationships for Access Control
Pervasive computing environments offer a multitude of information services that provide potentially complex types of information. Therefore, when running access control for sensit...
Urs Hengartner, Peter Steenkiste
APIN
1999
107views more  APIN 1999»
15 years 6 months ago
Massively Parallel Probabilistic Reasoning with Boltzmann Machines
We present a method for mapping a given Bayesian network to a Boltzmann machine architecture, in the sense that the the updating process of the resulting Boltzmann machine model pr...
Petri Myllymäki
CAS
2008
118views more  CAS 2008»
15 years 6 months ago
A Novel Method for Measuring the Structural Information Content of Networks
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
Matthias Dehmer