4325 search results - page 803 / 865 » Incremental computation with names |
105
click to vote
TCS
2010
14 years 9 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...
125
click to vote
WG
2010
Springer
14 years 9 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
124
click to vote
ECCV
2010
Springer
14 years 9 months ago
2010
Springer
We present a novel framework for the recognition of facial expressions at arbitrary poses that is based on 2D geometric features. We address the problem by first mapping the 2D loc...
110
Voted
MICCAI
2010
Springer
14 years 9 months ago
2010
Springer
Recent advances in diffusion weighted MR imaging (dMRI) has made it a tool of choice for investigating white matter abnormalities of the brain and central nervous system. In this w...
96
Voted
MM
2010
ACM
14 years 9 months ago
2010
ACM
In this paper, we investigate how an unlabeled image corpus can facilitate the segmentation of any given image. A simple yet efficient multi-task joint sparse representation model...