3778 search results - page 12 / 756 » Erdos-Ko-Rado for three sets |
ECCV
2000
Springer
14 years 8 months ago
2000
Springer
We improve the promising Colour by Correlation method for computational colour constancy by modifying it to work in a three dimensional colour space. The previous version of the al...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is (n77/141) = (n0.546 ), fo...
SIGUCCS
2000
ACM
13 years 11 months ago
2000
ACM
After thirty-plus years of making small “mid-course corrections” types of changes to the support paradigm, many on the Iowa State University campus thought it was time to make...
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
ENDM
2007
13 years 6 months ago
2007
Providing a complete description of the stable set polytopes of claw-free graphs is a longstanding open problem since almost twenty years. Eisenbrandt et al. recently achieved a b...