: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
— Spiking neural networks have been shown capable of simulating sigmoidal artificial neural networks providing promising evidence that they too are universal function approximat...
Silvia Ferrari, Bhavesh Mehta, Gianluca Di Muro, A...
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...
We use a generative history-based model to predict the most likely derivation of a dependency parse. Our probabilistic model is based on Incremental Sigmoid Belief Networks, a rec...
It is consistent that there is a set mapping from the four-tuples of n into the finite subsets with no free subsets of size tn for some natural number tn. For any n < it is con...