Sciweavers

297 search results - page 27 / 60
» Every Sequence Is Decompressible from a Random One
Sort
View
JSAC
2010
188views more  JSAC 2010»
14 years 5 months ago
Random-walk based approach to detect clone attacks in wireless sensor networks
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...
Yingpei Zeng, Jiannong Cao, Shigeng Zhang, Shanqin...
ALT
2009
Springer
15 years 8 months ago
Uncountable Automatic Classes and Learning
In this paper we consider uncountable classes recognizable by ω-automata and investigate suitable learning paradigms for them. In particular, the counterparts of explanatory, vac...
Sanjay Jain, Qinglong Luo, Pavel Semukhin, Frank S...
HASE
2008
IEEE
15 years 5 months ago
Small Logs for Transactional Services: Distinction is Much More Accurate than (Positive) Discrimination
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...
Debmalya Biswas, Thomas Gazagnaire, Blaise Genest
RTSS
1996
IEEE
15 years 3 months ago
A multiframe model for real-time tasks
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 ...
Aloysius K. Mok, Deji Chen
IIE
2007
56views more  IIE 2007»
14 years 11 months ago
Recursion Versus Iteration with the List as a Data Structure
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...
Izabella Foltynowicz