251 search results - page 46 / 51 » Polynomial Time Algorithms for Three-Label Point Labeling |
ICRA
2003
IEEE
14 years 24 days ago
2003
IEEE
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
COMPGEOM
2010
ACM
14 years 18 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
ML
2008
ACM
13 years 7 months ago
2008
ACM
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
ECML
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Active learning algorithms attempt to accelerate the learning process by requesting labels for the most informative items first. In real-world problems, however, there ma...