5 search results - page 1 / 1 » Generating Maximal Independent Sets for Hypergraphs with Bou... |
LATIN
2004
Springer
13 years 10 months ago
2004
Springer
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
SIAMCOMP
2000
13 years 4 months ago
2000
Abstract. 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 parti...
ICALP
2000
Springer
13 years 8 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...
TIT
2011
12 years 11 months ago
2011
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
DCOSS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...