58 search results - page 6 / 12 » Which Triangulations Approximate the Complete Graph |
AVBPA
2003
Springer
14 years 3 months ago
2003
Springer
In this paper a completely automatic face recognition system is presented. The system is inspired by the elastic bunch graph method, but the fiducial point localization is complet...
RSA
2008
13 years 9 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
ICDM
2007
IEEE
14 years 4 months ago
2007
IEEE
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
EDBT
2009
ACM
14 years 4 months ago
2009
ACM
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
CVPR
2004
IEEE
14 years 11 months ago
2004
IEEE
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...