108 search results - page 8 / 22 » On Computing the Centroid of the Vertices of an Arrangement ... |
ICANN
2010
Springer
13 years 8 months ago
2010
Springer
Visual recognition faces the difficult problem of recognizing objects despite the multitude of their appearances. Ample neuroscientific evidence shows that the cortex uses a topogr...
FOCS
1996
IEEE
13 years 11 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
COCOON
1999
Springer
13 years 11 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...