349 search results - page 32 / 70 » Covering a Set of Points with a Minimum Number of Lines |
ICDAR
2011
IEEE
12 years 7 months ago
2011
IEEE
Abstract—In this paper, we present a novel languageindependent algorithm for extracting text-lines from handwritten document images. Our algorithm is based on the seam carving ap...
ALGORITHMICA
2005
13 years 7 months ago
2005
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
3DIM
2001
IEEE
13 years 11 months ago
2001
IEEE
We introduce a novel outlook on the self-calibration task, by considering images taken by a camera in motion, allowing for zooming and focusing. Apart from the complex relationshi...
COMPGEOM
2000
ACM
14 years 7 days ago
2000
ACM
The regression depth of a hyperplane with respect to a set of n points in Rd is the minimum number of points the hyperplane must pass through in a rotation to vertical. We general...
COMBINATORICS
2006
13 years 8 months ago
2006
A d-dimensional hypercube drawing of a graph represents the vertices by distinct points in {0, 1}d, such that the line-segments representing the edges do not cross. We study lower...