We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linea...
Wayne Goddard, Stephen T. Hedetniemi, David Pokras...
Application of covering codes to data embedding improves embedding efficiency and security of steganographic schemes. In this paper, we describe several familes of covering codes c...
In this paper, we propose a partial interference cancellation (PIC) group decoding strategy/scheme for linear dispersive space-time block codes (STBC) and a design criterion for th...
The LAPACK software project currently under development is intended to provide a portable linear algebra library for high performance computers. LAPACK will make use of the Level 1...
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...