Sciweavers

2996 search results - page 16 / 600
» Numberings and Randomness
Sort
View
SODA
2003
ACM
115views Algorithms» more  SODA 2003»
13 years 11 months ago
Random walks on the vertices of transportation polytopes with constant number of sources
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
Mary Cryan, Martin E. Dyer, Haiko Müller, Lee...
ICALP
2007
Springer
14 years 4 months ago
On the Chromatic Number of Random Graphs
In this paper we consider the classical Erd˝os-R´enyi model of random graphs Gn,p. We show that for p = p(n) ≤ n−3/4−δ , for any fixed δ > 0, the chromatic number χ...
Amin Coja-Oghlan, Konstantinos Panagiotou, Angelik...
NORDSEC
2009
Springer
14 years 4 months ago
Towards True Random Number Generation in Mobile Environments
In our paper, we analyze possibilities to generate true random data in mobile devices such as mobile phones or pocket computers. We show how to extract arguably true random data w...
Jan Bouda, Jan Krhovjak, Vashek Matyas, Petr Svend...
COMBINATORICA
2011
12 years 9 months ago
On the chromatic number of random geometric graphs
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
Colin McDiarmid, Tobias Müller
JSAC
2008
106views more  JSAC 2008»
13 years 9 months ago
Enhanced multiuser random beamforming: dealing with the not so large number of users case
We consider the downlink of a wireless system with an M-antenna base station and K single-antenna users. A limited feedback-based scheduling and precoding scenario is considered th...
Marios Kountouris, David Gesbert, Thomas Sälz...