5606 search results - page 717 / 1122 » Randomization Techniques for Graphs. |
181
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—We analyze fading interference relay networks where M single-antenna source-destination terminal pairs communicate concurrently and in the same frequency band through a set of K...
172
click to vote
JSAC
2006
15 years 6 months ago
2006
We consider a code-spread and chip-interleaved time-hopping (TH) multiple-access scheme for multiuser ultra-wideband (UWB) communications. In such a system, each user's chip s...
159
click to vote
EOR
2007
15 years 6 months ago
2007
In this paper, we consider a discrete-time finite-capacity queue with Bernoulli arrivals and batch services. In this queue, the single server has a variable service capacity and s...
163
click to vote
SIAMSC
2008
15 years 6 months ago
2008
Abstract. This paper presents a new stochastic preconditioning approach for large sparse matrices. For the class of matrices that are row-wise and column-wise irreducibly diagonall...
166
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
The Gibbard-Satterthwaite Theorem states that (in unrestricted settings) any reasonable voting rule is manipulable. Recently, a quantitative version of this theorem was proved by ...