1355 search results - page 27 / 271 » Alternating Timed Automata over Bounded Time |
CRYPTO
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
EVOW
2010
Springer
14 years 22 days ago
2010
Springer
In this paper we report on the synthesis of sounds using cellular automata, specifically the multitype voter model. The mapping process adopted is based on digital signal processin...
HCI
2007
13 years 9 months ago
2007
As the importance of recommender systems increases, in combination with the explosion in data available over the internet and in our own digital libraries, we suggest an alternativ...
GLOBECOM
2007
IEEE
13 years 7 months ago
2007
IEEE
— In this paper, we introduce a network multicast problem called the alternating multicast problem. In this problem, there is more than one multicast on the network, but only one...