1552 search results - page 10 / 311 » On the Complexity of Constant Propagation |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
An infinite word has the property Rm if every factor has exactly m return words. Vuillon showed that R2 characterizes Sturmian words. We prove that a word satisfies Rm if its compl...
IEEEPACT
1997
IEEE
15 years 1 months ago
1997
IEEE
This paper addresses the issue of how router complexity a ects the overall performance in deterministic and adaptive routing under virtual cut-through switching in k-ary n-cube ne...
65
Voted
AROBOTS
2004
14 years 9 months ago
2004
In this paper, we present discrete-time, nonspatial, macroscopic models able to capture the dynamics of collective aggregation experiments using groups of embodied agents endowed ...
EUROCRYPT
1990
Springer
15 years 1 months ago
1990
Springer
The relation between the Walsh-Hadamard transform and the autocorrelation function of Boolean functions is used to study propagation characteristics of these functions. The Strict...
79
Voted
IJRFITA
2007
14 years 9 months ago
2007
: In this paper we extend the theory of Radio Frequency (RF) propagation as it relates to propagation within metal circular pipes. This work is motivated by a need to understand th...