Sciweavers

854 search results - page 144 / 171
» Abstracting from Failure Probabilities
Sort
View
TC
2008
15 years 1 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
TIT
2008
102views more  TIT 2008»
15 years 1 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
TIT
2008
129views more  TIT 2008»
15 years 1 months ago
Cooperative Fading Regions for Decode and Forward Relaying
Abstract--Cooperative transmission protocols over fading channels are based on a number of relaying nodes to form virtual multiantenna transmissions. Diversity provided by these te...
Stefano Savazzi, Umberto Spagnolini
JCT
2007
150views more  JCT 2007»
15 years 1 months ago
On the degree distribution of the nodes in increasing trees
Abstract. Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e.,...
Markus Kuba, Alois Panholzer
TON
1998
145views more  TON 1998»
15 years 1 months ago
Adaptive wavelength routing in all-optical networks
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...
Ahmed Mokhtar, Murat Azizoglu