Sciweavers

635 search results - page 104 / 127
» Four states are enough!
Sort
View
FSE
2005
Springer
153views Cryptology» more  FSE 2005»
14 years 3 months ago
F-FCSR: Design of a New Class of Stream Ciphers
In this paper we present a new class of stream ciphers based on a very simple mechanism. The heart of our method is a Feedback with Carry Shift Registers (FCSR) automaton. This au...
François Arnault, Thierry P. Berger
ICMI
2004
Springer
263views Biometrics» more  ICMI 2004»
14 years 3 months ago
Analysis of emotion recognition using facial expressions, speech and multimodal information
The interaction between human beings and computers will be more natural if computers are able to perceive and respond to human non-verbal communication such as emotions. Although ...
Carlos Busso, Zhigang Deng, Serdar Yildirim, Murta...
CCS
2008
ACM
13 years 12 months ago
Stale-safe security properties for group-based secure information sharing
Attribute staleness arises due to the physical distribution of authorization information, decision and enforcement points. This is a fundamental problem in virtually any secure di...
Ram Krishnan, Jianwei Niu, Ravi S. Sandhu, William...
OPODIS
2007
13 years 11 months ago
Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?
Consider the following game between a worm and an alert3 over a network of n nodes. Initially, no nodes are infected or alerted and each node in the network is a special detector n...
James Aspnes, Navin Rustagi, Jared Saia
JCT
2008
109views more  JCT 2008»
13 years 10 months ago
Decomposing Berge graphs and detecting balanced skew partitions
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
Nicolas Trotignon