Sciweavers

1578 search results - page 45 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
IPL
2010
71views more  IPL 2010»
13 years 7 months ago
New common ancestor problems in trees and directed acyclic graphs
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...
Johannes Fischer, Daniel H. Huson
JSAC
2006
174views more  JSAC 2006»
13 years 8 months ago
Integrated Radio Resource Allocation for Multihop Cellular Networks With Fixed Relay Stations
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...
Yajian Liu, Reza Hoshyar, X. Yang, Rahim Tafazolli
INFOCOM
1998
IEEE
14 years 28 days ago
Loop-Free Multipath Routing Using Generalized Diffusing Computations
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...
William T. Zaumen, J. J. Garcia-Luna-Aceves
SPIRE
1998
Springer
14 years 26 days ago
Direct Pattern Matching on Compressed Text
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...
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
JCM
2006
72views more  JCM 2006»
13 years 8 months ago
QoS Routing with Bandwidth and Hop-Count Consideration: A Performance Perspective
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...
Bo Peng, Andrew H. Kemp, Said Boussakta