Sciweavers

849 search results - page 140 / 170
» Completely Non-malleable Schemes
Sort
View
EOR
2010
99views more  EOR 2010»
13 years 9 months ago
Min sum clustering with penalties
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
Refael Hassin, Einat Or
CORR
2006
Springer
118views Education» more  CORR 2006»
13 years 9 months ago
Wireless Information-Theoretic Security - Part I: Theoretical Aspects
In this two-part paper, we consider the transmission of confidential data over wireless wiretap channels. The first part presents an information-theoretic problem formulation in w...
Matthieu Bloch, João Barros, Miguel R. D. R...
IJNSEC
2008
129views more  IJNSEC 2008»
13 years 9 months ago
LAMAIDS: A Lightweight Adaptive Mobile Agent-based Intrusion Detection System
Intrusion detection system (IDS) has become an essential component of a computer security scheme as the number of security-breaking attempts originating inside organizations is in...
Mohamad A. Eid, Hassan Artail, Ayman I. Kayssi, Al...
CN
2007
115views more  CN 2007»
13 years 9 months ago
SPAD: A distributed middleware architecture for QoS enhanced alternate path discovery
In the next generation Internet, the network will evolve from a plain communication medium into one that provides endless services to the users. These services will be composed of...
Thierry Rakotoarivelo, Patrick Sénac, Aruna...
JAIR
2006
117views more  JAIR 2006»
13 years 9 months ago
Admissible and Restrained Revision
As partial justification of their framework for iterated belief revision Darwiche and Pearl convincingly argued against Boutilier's natural revision and provided a prototypic...
Richard Booth, Thomas Andreas Meyer