672 search results - page 35 / 135 » Words and forbidden factors |
116
click to vote
WALCOM
2007
IEEE
15 years 29 days ago
2007
IEEE
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
JSYML
2010
14 years 6 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
100
click to vote
IJON
2008
14 years 11 months ago
2008
Presence-absence (0-1) observations are special in that often the absence of evidence is not evidence of absence. Here we develop an independent factor model, which has the unique...
117
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
Some recent dereverberation approaches that have been effective for automatic speech recognition (ASR) applications, model reverberation as a linear convolution operation in the s...
DLT
2008
15 years 1 months ago
2008
By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of...