Sciweavers

106 search results - page 9 / 22
» Average Case Analysis for Tree Labelling Schemes
Sort
View
SCHEDULING
2008
72views more  SCHEDULING 2008»
14 years 9 months ago
The impact of local policies on the quality of packet routing in paths, trees, and rings
We consider the packet routing problem in store-and-forward networks whose topologies are either paths, trees, or rings. We are interested by the quality of the solution produced,...
Eric Angel, Evripidis Bampis, Fanny Pascual
OTM
2004
Springer
15 years 2 months ago
A Time Predictable Instruction Cache for a Java Processor
Cache memories are mandatory to bridge the growing gap between CPU speed and main memory access time. Standard cache organizations improve the average execution time but are diffi...
Martin Schoeberl
EMNLP
2007
14 years 11 months ago
Dependency Parsing and Domain Adaptation with LR Models and Parser Ensembles
We present a data-driven variant of the LR algorithm for dependency parsing, and extend it with a best-first search for probabilistic generalized LR dependency parsing. Parser act...
Kenji Sagae, Jun-ichi Tsujii
VTC
2008
IEEE
15 years 3 months ago
High Rate Two-Way Amplify-and-Forward Half-Duplex Relaying with OSTBC
—In this paper, we derive tight upper and lower bounds for the average sum rate of two-way amplify-andforward (AF) half-duplex relaying, which show that two-way AF half-duplex re...
Yang Han, See Ho Ting, Chin Keong Ho, Woon Hau Chi...
INFOCOM
2008
IEEE
15 years 3 months ago
BAKE: A Balanced Kautz Tree Structure for Peer-to-Peer Networks
Abstract—In order to improve scalability and reduce maintenance overhead for structured Peer-to-Peer systems, researchers design optimal architectures with constant degree and lo...
Deke Guo, Yunhao Liu, Xiang-Yang Li