985 search results - page 103 / 197 » Piercing Convex Sets |
147
click to vote
JCT
2011
14 years 11 months ago
2011
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
184
click to vote
ENDM
2011
14 years 4 months ago
2011
We study a combinatorial game called Bichromatic Triangle Game, defined as follows. Two players R and B construct a triangulation on a given planar point set V . Starting from no...
136
click to vote
ICDM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
121
click to vote
CCCG
2010
15 years 6 months ago
2010
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
153
click to vote
BMVC
2000
15 years 5 months ago
2000
The hybrid Radon-Fourier technique has been proposed for the discrimination and tracking of deforming and compound targets. The current work investigates the technique's uniq...