297 search results - page 27 / 60 » Every Sequence Is Decompressible from a Random One |
207
click to vote
JSAC
2010
15 years 25 days 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...
146
click to vote
ALT
2009
Springer
16 years 3 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...
140
click to vote
HASE
2008
IEEE
16 years 15 days 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...
151
click to vote
RTSS
1996
IEEE
15 years 10 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 ...
125
click to vote
IIE
2007
15 years 6 months 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...