Sciweavers

WG
2007
Springer
14 years 5 months ago
Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
Abstract. The computation of all minimal transversals of a given hypergraph in output-polynomial time is a long standing open question known as the transversal hypergraph generatio...
Matthias Hagen
GBRPR
2007
Springer
14 years 5 months ago
Hierarchy Construction Schemes Within the Scale Set Framework
Segmentation algorithms based on an energy minimisation framework often depend on a scale parameter which balances a fit to data and a regularising term. Irregular pyramids are de...
Jean-Hugues Pruvot, Luc Brun