37 search results - page 5 / 8 » Independent Sets in Bounded-Degree Hypergraphs |
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
: A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. Let H = H k n p be a random k-uniform hypergraph on a ver...
AINA
2010
IEEE
14 years 7 days ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
CLIMA
2010
13 years 9 months ago
2010
The paper considers interdependencies between secrets in a multiparty system. Each secret is assumed to be known only to a certain fixed set of parties. These sets can be viewed as...
FLAIRS
2004
13 years 8 months ago
2004
How to compute marginals efficiently is one of major concerned problems in probabilistic reasoning systems. Traditional graphical models do not preserve all conditional independen...