Sciweavers

1510 search results - page 139 / 302
» Upper Probabilities and Additivity
Sort
View
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
16 years 4 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
GLOBECOM
2009
IEEE
15 years 10 months ago
Least Squares Estimation for the Digital Compensation of Tx Leakage in zero-IF Receivers
—Transmitter Leakage has a significant impact on the system performance in mobile devices using zero-IF receivers and thus requires a suitable compensation. In contrast to analo...
Andreas Frotzscher, Gerhard Fettweis
158
Voted
GLOBECOM
2009
IEEE
15 years 10 months ago
Analysis of Degrees of Freedom of Interfering MISO Broadcast Channels
— In this paper, we provide a lower and upper bound for the number of degrees of freedom (DOF) of B multipleinput single-output (MISO) broadcast channels (BC) where each base sta...
Seokhwan Park, Inkyu Lee
155
Voted
ICC
2009
IEEE
232views Communications» more  ICC 2009»
15 years 10 months ago
Degrees of Freedom and Sum Rate Maximization for Two Mutually Interfering Broadcast Channels
— In this paper, we derive a precise expression of spatial degrees of freedom (DOF) for two mutually interfering broadcast channels (IFBC) as a function of arbitrary numbers of t...
Seokhwan Park, Inkyu Lee
INFOCOM
2009
IEEE
15 years 10 months ago
Optimum Network Coding for Delay Sensitive Applications in WiMAX Unicast
—MAC layer random network coding (MRNC) was proposed in [1] as an alternative to HARQ for reliable data transmission in WiMAX unicast. It has been shown that MRNC achieves a high...
Amin Alamdar Yazdi, Sameh Sorour, Shahrokh Valaee,...