A mixed-signal paradigm is presented for high-resolution parallel innerproduct computation in very high dimensions, suitable for efficient implementation of kernels in image processing. At the core of the externally digital architecture is a high-density, low-power analog array performing binary-binary partial matrix-vector multiplication. Full digital resolution is maintained even with low-res...

The Self Organizing Map (SOM) proposed by Kohonen [7] is a well known neural model which provides both quantization and clustering of the observation space. In this paper, we adapt the Bernoulli mixture approach, proposed by [6], to the model of binary topological map [2] and show that using a probabilistic formalism gives rise to better quantization process and classi cation performances.

a memory control for t-s fuzzy discrete-time systems with sto- chastic input delay is proposed in this paper. dierent from the common assumptions on the time delay in the existing literatures, it is assumed in this paper that the delays vary randomly and satisfy some probabilistic dis- tribution. a new state space model of the discrete-time t-s fuzzy system is derived by introducing some stocha...

We give several examples for Poisson approximation of quantities of interest in the analysis of algorithms: the distribution of node depth in a binary search tree, the distribution of the number of losers in an election algorithm and the discounted profile of a binary search tree. A simple and well-known upper bound for the total variation distance between the distribution of a sum of independe...

Based on a modifled Bernoulli-Gaussian model, we propose an adaptive maximum-likelihood channel equalizer, which is a block signal processing algorithm, for the detection of binary sequences transmitted through an unknown slowly time-varying channel. Both computational load and storage required by the proposed adaptive channel equalizer are linearly rather than exponentially proportional to the...

This paper introduces a probabilistic self-organizing map for topographic clustering, analysis and visualization of multivariate binary data or categorical data using binary coding. We propose a probabilistic formalism dedicated to binary data in which cells are represented by a Bernoulli distribution. Each cell is characterized by a prototype with the same binary coding as used in the data spa...

This paper presents the use of Bernoulli mixture models for Markov blanket filtering and classification of binary data. Bernoulli mixture models can be seen as a tool for partitioning an n-dimensional hypercube, identifying regions of high data density on the corners of the hypercube. Once Bernoulli mixture models are computed from a training dataset we use them for determining the Markov blank...

An iterative fuzzy clustering method is proposed to partition a set of multivariate binary observation vectors located at neighboring geographic sites. The method described here applies in a binary setup a recently proposed algorithm, called Neighborhood EM, which seeks a a partition that is both well clustered in the feature space and spatially regular [2]. This approach is derived from the EM...

We prove the Courtade-Kumar conjecture, for several classes of n-dimensional Boolean functions, for all n ≥ 2 and for all values of the error probability of the binary symmetric channel, 0 ≤ p ≤ 1 2 . This conjecture states that the mutual information between any Boolean function of an n-dimensional vector of independent and identically distributed inputs to a memoryless binary symmetric channe...