379 search results - page 21 / 76 » Strong reducibility of partial numberings |
DLT
2008
13 years 9 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...
CN
2006
13 years 7 months ago
2006
Internet maps are generally constructed using the traceroute tool from a few sources to many destinations. It appeared recently that this exploration process gives a partial and bi...
MICRO
2000
IEEE
14 years 1 days ago
2000
IEEE
Current superscalar microprocessors’ performance depends on its frequency and the number of useful instructions that can be processed per cycle (IPC). In this paper we propose a...
QEST
2006
IEEE
14 years 1 months ago
2006
IEEE
We analyze the effect of a few fiber delay loops on the number of deflections in an all optical packet switch. The switch is based on the ROMEO architecture developed by Alcatel...
CAEPIA
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. In this paper, some new approaches to training set size reduction are presented. These schemes basically consist of defining a small number of prototypes that represent ...