725 search results - page 23 / 145 » Bounding Degrees on RPL |
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
— 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...
AML
2004
14 years 9 months ago
2004
We show that there exists a single minimal (Turing) degree b < 0 s.t. for all c.e. degrees 0 < a < 0 , 0 = a b. Since b is minimal this means that b complements all c.e....
ENDM
2002
14 years 9 months ago
2002
Let k be an integer and M be a closed 2-manifold with Euler characteristic (M) 0. We prove that each polyhedral map G on M with minimum degree and large number of vertices conta...
94
Voted
IPTPS
2003
Springer
15 years 2 months ago
2003
Springer
Koorde1 is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such a...
DM
2008
14 years 9 months ago
2008
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that need to be removed from the graphs in the class in order to leave behind bounded s...