1986 search results - page 122 / 398 » Path Separability of Graphs |
APPROX
2006
Springer
14 years 20 days ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
EJC
2007
13 years 9 months ago
2007
We investigate the historical roots of the field of combinatorics on words. They comprise applications and interpretations in algebra, geometry and combinatorial enumeration. The...
ESA
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
CVPR
2003
IEEE
14 years 11 months ago
2003
IEEE
We present a method for extracting dense features from stereo and motion sequences. Our dense feature is defined symmetrically with respect to both images, and it is extracted dur...
DAGM
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents an optimization framework for the 3D reconstruction of the surfaces from stereo image pairs. The method is based on employing popular graph cut methods under th...