This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
Christian Desrosiers, Philippe Galinier, Alain Her...
We study explicit techniques for detection of safety errors, e.g., depth-first search, directed search, random walk, and bitstate hashing. We argue that it is not important to fin...
In the paper, two evolutionary approaches to the general DNA sequencing problem, assuming both negative and positive errors in the spectrum, are compared. The older of them is base...
We consider transmitting a source across a pair of independent, nonergodic channels with random states (e.g., slow-fading channels) so as to minimize the average distortion. The ge...
J. Nicholas Laneman, Emin Martinian, Gregory W. Wo...
Whenever handoff for a mobile user occurs in wireless ATM network, its connection must be reestablished in the new area. This paper proposes a new path rerouting scheme based on t...
Hee Yong Youn, Hee-Suk Kim, Hyunseung Choo, Sajal ...