Sciweavers

2735 search results - page 225 / 547
» Comparing notions of randomness
Sort
View
DAM
2008
134views more  DAM 2008»
13 years 11 months ago
Efficient algorithms for finding critical subgraphs
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...
ENTCS
2008
120views more  ENTCS 2008»
13 years 11 months ago
Complementarity of Error Detection Techniques
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...
Radek Pelánek, Václav Rosecký...
ANOR
2005
93views more  ANOR 2005»
13 years 10 months ago
Evolutionary Approaches to DNA Sequencing with Errors
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...
Jacek Blazewicz, Fred Glover, Marta Kasprzak
CORR
2004
Springer
99views Education» more  CORR 2004»
13 years 10 months ago
Source-Channel Diversity for Parallel Channels
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...
COMCOM
2002
79views more  COMCOM 2002»
13 years 10 months ago
Rerouting for handoff based on the distance in wireless ATM networks
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 ...