202 search results - page 36 / 41 » Counting Distance Permutations |
CAI
2002
Springer
13 years 7 months ago
2002
Springer
In a localized routing algorithm, node A currently holding the message forwards it based on the location of itself, its neighboring nodes and destination. We propose to use depth ...
ICUMT
2009
13 years 5 months ago
2009
Traditional routing strategies for multi-hop wireless networks forward packets by selecting at the sender side the next hop for each packet. Recently, such a paradigm has been call...
TWC
2010
13 years 2 months ago
2010
Abstract--We develop a new metric for quantifying end-toend throughput in multihop wireless networks, which we term random access transport capacity, since the interference model p...
RECOMB
2004
Springer
14 years 8 months ago
2004
Springer
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...