803 search results - page 96 / 161 » Independence in Direct-Product Graphs |
70
Voted
COMBINATORICA
2004
15 years 20 days ago
2004
We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with...
101
Voted
ECCC
1998
15 years 15 days ago
1998
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
115
Voted
IJAR
2010
14 years 11 months ago
2010
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
105
Voted
WDAG
2010
Springer
14 years 11 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
110
Voted
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
In this paper, we investigate limiting behavior of linear dynamic systems driven by random stochastic matrices. We introduce and study the new concepts of partial ergodicity and 1-...