Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Paper
State Splitting for Variable-Length Graphs
Abstract
The state splitting algorithm of Adler, Coppersmith, and Hassner for graphs with edges of fixed length is extended to graphs with edges of variable lengths. This has the potential to improve modulation code construction techniques. Although the ideas of state splitting come from dynamical systems, completely graph-theoretic terms are used. © 1986 IEEE
Related
David A. Selby
IBM J. Res. Dev
Conference paper
Low-Resource Speech Recognition of 500-Word Vocabularies
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design