Sciweavers

1693 search results - page 232 / 339
» fast 2008
Sort
View
TCOM
2008
100views more  TCOM 2008»
13 years 10 months ago
On the performance of concatenated convolutional code and Alamouti space-time code with noisy channel estimates and finite-depth
Abstract--In this paper, performance of the Alamouti spacetime code (STC) [1] and performance of the concatenation between the convolutional code and the Alamouti STC are derived. ...
Jittra Jootar, James R. Zeidler, John G. Proakis
TCOM
2008
98views more  TCOM 2008»
13 years 10 months ago
Performance evaluation of multi-hop CSMA/CA networks in fading environments
The performance of multi-hop CSMA/CA networks has in most cases been evaluated via simulations, or analytically using a perfect collision channel model. Using such methods, one ca...
Duong A. Hoang, Ronald A. Iltis
IPL
2007
101views more  IPL 2007»
13 years 10 months ago
Adjacency queries in dynamic sparse graphs
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
Lukasz Kowalik
TCS
2008
13 years 10 months ago
Reconstruction of convex lattice sets from tomographic projections in quartic time
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. Many algorithms have been publish...
Sara Brunetti, Alain Daurat
TCSV
2008
105views more  TCSV 2008»
13 years 10 months ago
Combination Load Balancing for Video-on-Demand Systems
We observe that an effect of "disk resource sharing" of multi-copy movie traffic has great impact on the blocking performance of a video-on-demand system. This observatio...
Jun Guo, Eric Wing Ming Wong, Sammy Chan, Peter Ta...