254 search results - page 5 / 51 » Deterministic Soliton Graphs |
SODA
2004
ACM
14 years 7 days ago
2004
ACM
WEA
2004
Springer
14 years 4 months ago
2004
Springer
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
CVPR
2011
IEEE
13 years 7 months ago
2011
IEEE
A practical lipreading system can be considered either as subject dependent (SD) or subject-independent (SI). An SD system is user-specific, i.e., customized for some particular ...
CSR
2008
Springer
14 years 19 days ago
2008
Springer
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
STRINGOLOGY
2008
14 years 8 days ago
2008
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...