108 search results - page 11 / 22 » Revisiting Two Classical Results on Graph Spectra |
IWPEC
2010
Springer
13 years 5 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
BC
1998
13 years 7 months ago
1998
Complexity measures of non-linear dynamics are a useful tool for quantifying observed stretching, folding, scaling and mixing processes in the Takens-reconstructed state space of h...
EMMCVPR
2003
Springer
14 years 24 days ago
2003
Springer
Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are v...
MST
2007
13 years 7 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
IPMI
2009
Springer
14 years 5 days ago
2009
Springer
Abstract. In this paper we propose a novel approach to define task-driven regularization constraints in deformable image registration using learned deformation priors. Our method ...