Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
Users of digital libraries usually want to know the exact author or authors of an article. But different authors may share the same names, either as full names or as initials and...
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
We study the contention/interaction among wireless nodes and med -ium access control design in game theory framework. We define a general class of games, called random access game...