206 search results - page 17 / 42 » Weak Alternating Automata Are Not That Weak |
FORMATS
2008
Springer
13 years 9 months ago
2008
Springer
Time dependant models have been intensively studied for many reasons, among others because of their applications in software verification and due to the development of embedded pla...
ECAI
2010
Springer
13 years 7 months ago
2010
Springer
AI Planning is concerned with the selection of actions towards achieving a goal. Research on cellular automata (CA) is concerned with the question how global behaviours arise from ...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper describes a counter scheme that uses hash functions to count how many times the user is allowed to play protected content in a DRM-enabled player. The proposed basic sc...
INDOCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
Saarinen recently proposed a chosen IV statistical attack, called the d-monomial test, and used it to find weaknesses in several proposed stream ciphers. In this paper we generali...