— We study by computer simulation a population of individuals playing the prisoner’s dilemma game. Each player has an invariable strategy (cooperate or defect) but the network ...
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
Abstract. Bayesian nets (BNs) appeared in the 1980s as a solution to computational and representational problems encountered in knowledge representation of uncertain information. S...
We present constructions of polyphase sequences suitable for the use as codewords in orthogonal frequency-division multiplexing (OFDM) with strictly bounded peak-to-mean envelope p...
This paper presents an analysis of the design of classifiers for use in a hierarchical object recognition approach. In this approach, a cascade of classifiers is arranged in a tr...
Bjoern Stenger, Arasanathan Thayananthan, Philip H...