127 search results - page 3 / 26 » Locally Thin Set Families |
AHSWN
2008
13 years 5 months ago
2008
Given a graph G, a k-dominating set of G is a subset S of its vertices with the property that every vertex of G is either in S or has at least k neighbors in S. We present a new i...
JSCIC
2008
13 years 5 months ago
2008
In this paper we shall discuss the numerical simulation of higher order geometric flows by level set methods. Main examples under considerations are surface diffusion and the Will...
AMDO
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we present an automatic face authentication system. Accurate segmentation of prominent facial features is accomplished by means of an extension of the Active Shape M...
SGP
2007
13 years 7 months ago
2007
We introduce an algorithm for reconstructing watertight surfaces from unoriented point sets. Using the Voronoi diagram of the input point set, we deduce a tensor field whose princ...
LATIN
2004
Springer
13 years 10 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...