359 search results - page 48 / 72 » Solving Geometric Covering Problems by Data Reduction |
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
A good distance metric is crucial for unsupervised learning from high-dimensional data. To learn a metric without any constraint or class label information, most unsupervised metr...
KDD
2000
ACM
14 years 16 days ago
2000
ACM
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
—We are concerned with enabling truly large scale autonomous navigation in typical human environments. To this end we describe the acquisition and modeling of large urban spaces ...
CGF
2010
13 years 9 months ago
2010
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
This paper presents robust click-point linking: a novel localized registration framework that allows users to interactively prescribe where the accuracy has to be high. By emphasi...