108 search results - page 5 / 22 » On Computing the Centroid of the Vertices of an Arrangement ... |
TCS
2010
13 years 5 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
DLT
2008
13 years 9 months ago
2008
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We present a closed form solution to the nonrigid shape and motion (NRSM) problem from point correspondences in multiple perspective uncalibrated views. Under the assumption that t...
COGSCI
2010
13 years 7 months ago
2010
Abecassis, Sera, Yonas, and Schwade (2001) have shown that young children represent shapes more metrically, and perhaps more holistically, than do older children and adults. How d...
CIARP
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...