CORR
2010
Springer
13 years 11 months ago
2010
Springer
An epidemic spreading in a network calls for a decision on the part of the network members: They should decide whether to protect themselves or not. Their decision depends on the ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We consider i) the overhead minimization of maximum-distance seperable (MDS) storage codes for the repair of a single failed node and ii) the total secure degrees-of-freedom (S-DoF...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract--We show that the maximization of the sum degreesof-freedom for the static flat-fading multiple-input multipleoutput (MIMO) interference channel is equivalent to a rank co...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
This paper investigates the effect of process variations on unity gain frequency (ft) in 30 nm gate length FinFET by performing extensive TCAD simulations. Six different geometric...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
This paper tackles the problem of how two selfish users jointly determine the operating point in the achievable rate region of a two-user Gaussian interference channel through barg...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
This paper introduces the security and trust concepts in wireless sensor networks and explains the difference between them, stating that even though both terms are used interchang...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Ontologies such as taxonomies, product catalogs or web directories are heavily used and hence evolve frequently to meet new requirements or to better reflect the current instance d...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
CORR
2010
Springer
13 years 11 months ago
2010
Springer
: We consider a class of point processes, which we call sub-Poisson; these are point processes that can be directionallyconvexly (dcx) dominated by some Poisson point process. The ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...