Sciweavers

36 search results - page 3 / 8
» New Bounds for Union-free Families of Sets
Sort
View
ORDER
2011
14 years 4 months ago
Order Types of Convex Bodies
We prove a Hadwiger transversal type result, characterizing convex position on a family of non-crossing convex bodies in the plane. This theorem suggests a definition for the ord...
Alfredo Hubard, Luis Montejano, Emiliano Mora, And...
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
15 years 4 months ago
Piercing Translates and Homothets of a Convex Body
According to a classical result of Gr¨unbaum, the transversal number τ(F) of any family F of pairwise-intersecting translates or homothets of a convex body C in Rd is bounded by...
Adrian Dumitrescu, Minghui Jiang
EOR
2008
75views more  EOR 2008»
14 years 9 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist
ICALP
2010
Springer
14 years 11 months ago
Covering and Packing in Linear Space
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
ICCV
2003
IEEE
15 years 11 months ago
Dominant Sets and Hierarchical Clustering
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
Massimiliano Pavan, Marcello Pelillo