297 search results - page 27 / 60 » Every Sequence Is Decompressible from a Random One |
132
Voted
JSAC
2010
14 years 7 months ago
2010
Abstract--Wireless sensor networks (WSNs) deployed in hostile environments are vulnerable to clone attacks. In such attack, an adversary compromises a few nodes, replicates them, a...
92
Voted
ALT
2009
Springer
15 years 9 months ago
2009
Springer
In this paper we consider uncountable classes recognizable by ω-automata and investigate suitable learning paradigms for them. In particular, the counterparts of explanatory, vac...
87
Voted
HASE
2008
IEEE
15 years 7 months ago
2008
IEEE
For complex services, logging is an integral part of many middleware aspects, especially, transactions and monitoring. In the event of a failure, the log allows us to deduce the c...
95
Voted
RTSS
1996
IEEE
15 years 4 months ago
1996
IEEE
The well-known periodic task model of Liu and Layland 1] assumes a worst-case execution time bound for every task and may be too pessimistic if the worst-case execution time of a ...
IIE
2007
15 years 14 days ago
2007
Abstract. A reversible sequence of steps from the specification of the algorithm and the mathematical definition of the recurrent solution through the recursive procedure, the ta...