1578 search results - page 45 / 316 » Direct Routing: Algorithms and Complexity |
116
Voted
IPL
2010
15 years 1 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
137
click to vote
JSAC
2006
15 years 2 months ago
2006
Recently, the notion that a logical next step towards future mobile radio networks is to introduce multihop relaying into cellular networks, has gained wide acceptance. Nevertheles...
133
Voted
INFOCOM
1998
IEEE
15 years 7 months ago
1998
IEEE
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...
120
Voted
SPIRE
1998
Springer
15 years 7 months ago
1998
Springer
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...
104
click to vote
JCM
2006
15 years 2 months ago
2006
QoS Routing has been studied to provide evidence that it can increase network utilization compared to routing that is insensitive to QoS traffic requirements. However, because of i...