286 search results - page 5 / 58 » Recognition Algorithm for Diamond-Free Graphs |
WG
2007
Springer
15 years 3 months ago
2007
Springer
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...
81
Voted
ICDAR
2009
IEEE
14 years 7 months ago
2009
IEEE
Standard cursive handwriting recognition is based on a language model, mostly a lexicon of possible word hypotheses or character n-grams. The result is a list of word alternatives...
GBRPR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connecte...
STOC
2002
ACM
15 years 9 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Recognition difficulty is statistically linked to ??? subject covariate factors such as age and gender for three face recognition algorithms: principle components analysis, an int...