303 search results - page 18 / 61 » Computing Minimal Spanning Subgraphs in Linear Time |
PAMI
2010
13 years 7 months ago
2010
—We propose a combinatorial solution to determine the optimal elastic matching of a deformable template to an image. The central idea is to cast the optimal matching of each temp...
COCO
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we investigate effective versions of Hausdorff dimension which have been recently introduced by Lutz. We focus on dimension in the class E of sets computable in line...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
It is well known in the photometric stereo literature that uncalibrated photometric stereo, where light source strength and direction are unknown, can recover the surface geometry...
SOCC
2008
IEEE
14 years 3 months ago
2008
IEEE
— Scaling down the voltage levels of the processing elements (PEs) in a Network-on-Chip (NoC) can significantly reduce the computation energy consumption with an overhead of the...
DM
2006
13 years 8 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...