253 search results - page 21 / 51 » Faster Approximation of Distances in Graphs |
CAD
2004
Springer
13 years 7 months ago
2004
Springer
This paper presents a method for finding cutting paths on a 3D triangular mesh surface to reduce the stretch in the flattened surface. The cutting paths link the surface boundary ...
ICALP
2003
Springer
14 years 18 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
IAAI
2003
13 years 8 months ago
2003
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
JCSS
2011
13 years 2 months ago
2011
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Given five motion vectors observed in a calibrated camera, what is the rotational and translational velocity of the camera? This problem is the infinitesimal motion analogue to th...