Sciweavers

727 search results - page 121 / 146
» A Calculus of Bounded Capacities
Sort
View
TIT
2010
115views Education» more  TIT 2010»
14 years 4 months ago
On resource allocation in fading multiple-access channels-an efficient approximate projection approach
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
TWC
2010
14 years 4 months ago
On the diversity order of non-orthogonal amplify-and-forward over block-fading channels
Abstract--In this paper, we deal with the performance of nonorthogonal Amplify-and-Forward protocols over block-fading channels (BFNAF), where the source retransmits the same data ...
Ioannis Krikidis, John S. Thompson, Steve McLaughl...
DAC
2008
ACM
15 years 10 months ago
Construction of concrete verification models from C++
C++ based verification methodologies are now emerging as the preferred method for SOC design. However most of the verification involving the C++ models are simulation based. The c...
Malay Haldar, Gagandeep Singh, Saurabh Prabhakar, ...
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
15 years 10 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata
ICALP
2009
Springer
15 years 10 months ago
A Distributed and Oblivious Heap
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
Christian Scheideler, Stefan Schmid