7351 search results - page 191 / 1471 » Segmenting Point Sets |
109
click to vote
DAGM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Autonomous collision avoidance in vehicles requires an accurate seperation of obstacles from the background, particularly near the focus of expansion. In this paper, we p...
139
click to vote
ICPR
2010
IEEE
15 years 8 months ago
2010
IEEE
—The problem we address in the paper is how to learn a joint representation from data lying on multiple manifolds. We are given multiple data sets and there is an underlying comm...
137
click to vote
DCG
2010
15 years 4 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
139
Voted
WADS
1995
Springer
15 years 8 months ago
1995
Springer
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
175
Voted
IWOCA
2010
Springer
14 years 11 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...