Sciweavers

Share
3 search results - page 1 / 1
» Generating Partial and Multiple Transversals of a Hypergraph
Sort
View
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
8 years 6 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
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...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
ICALP
2000
Springer
8 years 10 months ago
Generating Partial and Multiple Transversals of a Hypergraph
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...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
CAP
2010
8 years 1 months ago
Parallel computation of the minimal elements of a poset
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...
books