5100 search results - page 577 / 1020 » The Linear Complexity of a Graph |
194
click to vote
MFCS
2007
Springer
16 years 29 days ago
2007
Springer
In this paper we study language recognition by two-dimensional cellular automata on different possible neighborhoods. Since it is known that all complete neighborhoods are linearl...
179
click to vote
ICMCS
2006
IEEE
16 years 26 days ago
2006
IEEE
Given a number of available layers of source data and a transmission bit budget, we propose an algorithm that determines how many layers should be sent and how many protection bit...
166
click to vote
HASE
2005
IEEE
16 years 13 days ago
2005
IEEE
Checking various temporal requirements is a key dependability concern in safety-critical systems. As modelchecking approaches do not scale well to systems of high complexity the r...
158
click to vote
ISCAS
2005
IEEE
16 years 12 days ago
2005
IEEE
— Based on a Fourier series analysis, an analytic interconnect model is presented which is suitable for periodic signals, such as a clock signal. In this model, the far end time ...
167
click to vote
EUROCAST
2005
Springer
16 years 10 days ago
2005
Springer
In this paper, we present a new pseudo-random sequence generator, constructed by the generalized discrete Baker transformation. This new generator is called Cascaded Baker Register...