Sciweavers

1605 search results - page 147 / 321
» On Partitional Labelings of Graphs
Sort
View
JMM2
2007
127views more  JMM2 2007»
13 years 10 months ago
Robust Face Recognition through Local Graph Matching
— A novel face recognition method is proposed, in which face images are represented by a set of local labeled graphs, each containing information about the appearance and geometr...
Ehsan Fazl Ersi, John S. Zelek, John K. Tsotsos
WG
2010
Springer
13 years 8 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski
CVPR
2006
IEEE
15 years 13 days ago
Graph Laplacian Kernels for Object Classification from a Single Example
Classification with only one labeled example per class is a challenging problem in machine learning and pattern recognition. While there have been some attempts to address this pr...
Hong Chang, Dit-Yan Yeung
ICASSP
2008
IEEE
14 years 4 months ago
Graph laplacian for interactive image retrieval
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in a step-by-step lab...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
13 years 10 months ago
Constraint models for graceful graphs
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...
Barbara M. Smith, Jean-François Puget