349 search results - page 46 / 70 » Covering a Set of Points with a Minimum Number of Lines |
CVPR
2011
IEEE
13 years 4 months ago
2011
IEEE
Traditional computer vision and machine learning algorithms have been largely studied in a centralized setting, where all the processing is performed at a single central location....
WWW
2010
ACM
13 years 12 months ago
2010
ACM
This paper presents a technique for visualizing large spatial data sets in Web Mapping Systems (WMS). The technique creates a hierarchical clustering tree, which is subsequently u...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
PAMI
2008
13 years 7 months ago
2008
We propose a geometric approach to 3D motion segmentation from point correspondences in three perspective views. We demonstrate that after applying a polynomial embedding to the po...
DAM
2011
13 years 2 months ago
2011
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...