2681 search results - page 108 / 537 » Problem F |
COMPGEOM
2005
ACM
14 years 6 days ago
2005
ACM
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
SIAMDM
2010
13 years 8 months ago
2010
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
COMPGEOM
2006
ACM
14 years 4 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
SIGCSE
2005
ACM
14 years 3 months ago
2005
ACM
The paper advocates a wider use of puzzles and puzzle-like games in teaching the analysis of algorithms. It discusses many specific examples—from classic puzzles of recreational...