Sciweavers

366 search results - page 24 / 74
» Dynamic Programming for Graphs on Surfaces
Sort
View
SI3D
2012
ACM
12 years 2 months ago
4D parametric motion graphs for interactive animation
A 4D parametric motion graph representation is presented for interactive animation from actor performance capture in a multiple camera studio. The representation is based on a 4D ...
Dan Casas, Margara Tejera, Jean-Yves Guillemaut, A...
CVPR
2011
IEEE
13 years 2 months ago
Face Recognition with Large Pose Variation
2-D face recognition in the presence of large pose variations presents a significant challenge. When comparing a frontal image of a face to a near profile image, one must cope w...
Carlos Castillo, David Jacobs
JDA
2010
122views more  JDA 2010»
13 years 2 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Ignasi Sau, Dimitrios M. Thilikos
TCS
2008
13 years 7 months ago
On the bandwidth of 3-dimensional Hamming graphs
This paper presents strategies for improving the known upper and lower bounds for the bandwidth of Hamming graphs (Kn)d and [0, 1]d. Our labeling strategy lowers the upper bound o...
J. Balogh, Sergei L. Bezrukov, L. H. Harper, &Aacu...
CVPR
2006
IEEE
14 years 9 months ago
Shape from Shading: Recognizing the Mountains through a Global View
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
Qihui Zhu, Jianbo Shi