1814 search results - page 145 / 363 » Improved Results on Geometric Hitting Set Problems |
197
click to vote
PAMI
2010
15 years 4 months ago
2010
—A common way to model multiclass classification problems is to design a set of binary classifiers and to combine them. Error-Correcting Output Codes (ECOC) represent a successfu...
156
Voted
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...
181
click to vote
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
148
click to vote
TSMC
1998
15 years 5 months ago
1998
—We formulate and address the problem of planning a pushing manipulation by a mobile robot which tries to rearrange several movable objects in its work space. We present an algor...
147
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
We examine the stereo correspondence problem in the presence of slanted scene surfaces. In particular, we highlight a previously overlooked geometric fact: a horizontally slanted ...