Sciweavers

286 search results - page 5 / 58
» Recognition Algorithm for Diamond-Free Graphs
Sort
View
WG
2007
Springer
14 years 1 months ago
Characterization and Recognition of Digraphs of Bounded Kelly-width
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...
Daniel Meister, Jan Arne Telle, Martin Vatshelle
ICDAR
2009
IEEE
13 years 5 months ago
Recurrent HMMs and Cursive Handwriting Recognition Graphs
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...
Marc-Peter Schambach
GBRPR
2005
Springer
14 years 28 days ago
A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs
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...
Bertrand Cuissart, Jean-Jacques Hébrard
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
14 years 7 months ago
Recognizing string graphs in NP
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...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
CVPR
2004
IEEE
14 years 9 months ago
How Features of the Human Face Affect Recognition: A Statistical Comparison of Three Face Recognition Algorithms
Recognition difficulty is statistically linked to ??? subject covariate factors such as age and gender for three face recognition algorithms: principle components analysis, an int...
Geof H. Givens, J. Ross Beveridge, Bruce A. Draper...