We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
We study the problems of existence and construction of infinite schedules for finite weighted automata and one-clock weighted timed automata, subject to boundary constraints on the...
Patricia Bouyer, Ulrich Fahrenberg, Kim Guldstrand...
Abstract. In neural networks, network faults can be exhibited in different forms, such as node fault and weight fault. One kind of weight faults is due to the hardware or software ...
In wireless mobile environments, data broadcasting is an effective approach to disseminate information to mobile clients. In some applications, the access pattern of all the data c...
The Self Organizing Map (SOM) involves neural networks, that learns the features of input data thorough unsupervised, competitive neighborhood learning. In the SOM learning algorit...