131 search results - page 7 / 27 » Hypergraphs with independent neighborhoods |
FLAIRS
2004
13 years 9 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...
SIAMDM
2010
13 years 6 months ago
2010
Let F be an r-uniform hypergraph with f vertices, where f > r ≥ 3. In [12], R. Yuster posed the problem of whether there exists an algorithm which, for a given r-uniform hyper...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
-- In this paper, we put forward our approach for answering aggregated queries over imprecise data using domain specific taxonomies. A new concept we call the weighted hierarchical...
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...
FEGC
2008
13 years 9 months ago
2008
We propose a way of extracting high-confidence association rules from datasets consisting of unlabeled trees. The antecedents are obtained through a computation akin to a hypergrap...