520 search results - page 82 / 104 » Subset Counting in Trees |
VEE
2006
ACM
14 years 1 months ago
2006
ACM
The Pi-calculus is a formalism to model and reason about highly concurrent and dynamic systems. Most of the expressive power of the language comes from the ability to pass communi...
HICSS
1999
IEEE
14 years 2 days ago
1999
IEEE
Assessing the reliability of a software system has always been an elusive target. A program may work very well for a number of years and this same program may suddenly become quit...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
BROADNETS
2006
IEEE
13 years 9 months ago
2006
IEEE
Routing protocols developed for ad hoc wireless networks use broadcast transmission to either discover a route or disseminate information. More specifically, reactive routing proto...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...