597 search results - page 9 / 120 » Dominating Distributions and Learnability |
122
Voted
GLOBECOM
2006
IEEE
15 years 6 months ago
2006
IEEE
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
100
click to vote
SIAMJO
2002
15 years 8 days ago
2002
We consider the problem of constructing mean{risk models which are consistent with the second degree stochastic dominance relation. By exploiting duality relations of convex analys...
197
Voted
DCOSS
2011
Springer
14 years 12 days ago
2011
Springer
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
198
Voted
ICDCN
2011
Springer
14 years 4 months ago
2011
Springer
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
119
click to vote
COLT
2001
Springer
15 years 5 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...