A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
This work takes place in the context of hierarchical stochastic models for the resolution of discrete inverse problems from low level vision. Some of these models lie on the nodes...
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
This book covers the following topics: The biological paradigm, Threshold logic, Weighted Networks, The Perceptron, Perceptron learning, Unsupervised learning and clustering algori...