3008 search results - page 331 / 602 » Independence in connected graphs |
146
click to vote
COMBINATORICA
2004
15 years 6 months 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...
160
click to vote
ECCC
1998
15 years 6 months 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...
192
click to vote
IJAR
2010
15 years 5 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...
187
click to vote
WDAG
2010
Springer
15 years 5 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,...
213
click to vote
PERCOM
2011
ACM
14 years 10 months ago
2011
ACM
—The need to prolong the ability for older adults to live at home independently has become an important area of smart environment research. In this proposal, we demonstrate a web...