12 search results - page 2 / 3 » cpc 2011 |
CPC
2011
12 years 8 months ago
2011
CPC
2011
12 years 11 months ago
2011
We show that the number of halving sets of a set of n points in R4 is O n4−1/18 , improving the previous bound of [9] with a simpler (albeit similar) proof.
CPC
2011
12 years 11 months ago
2011
Let X be the random variable that counts the number of triangles in the binomial random graph G(n, p). We show that for some positive constant c, the probability that X deviates f...
CPC
2011
12 years 11 months ago
2011
Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertices in V . We study the correlation between the events {a → s} and {s → b}. We show that...
AINA
2011
IEEE
12 years 8 months ago
2011
IEEE
— Next generation wireless networks will be heterogeneous, where several primary users (PU e.g. licensed users) and secondary users (SU e.g. unlicensed users) can operate in the ...