Sciweavers

357 search results - page 47 / 72
» On Reversibility and Determinism in P Systems
Sort
View
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
14 years 4 months ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
INFOCOM
2009
IEEE
14 years 5 months ago
Protecting Against Network Infections: A Game Theoretic Perspective
— Security breaches and attacks are critical problems in today’s networking. A key-point is that the security of each host depends not only on the protection strategies it choo...
Jasmina Omic, Ariel Orda, Piet Van Mieghem
SCESM
2006
ACM
257views Algorithms» more  SCESM 2006»
14 years 4 months ago
Test ready UML statechart models
The dynamic behavior of systems is best described by Finite-state machines. Generation of executable tests from behavioral models such as UML Statecharts offers benefits such as s...
P. V. R. Murthy, P. C. Anitha, M. Mahesh, Rajesh S...
CHES
2005
Springer
108views Cryptology» more  CHES 2005»
14 years 4 months ago
Further Hidden Markov Model Cryptanalysis
We extend the model of Karlof and Wagner for modelling side channel attacks via Input Driven Hidden Markov Models (IDHMM) to the case where not every state corresponds to a single ...
P. J. Green, Richard Noad, Nigel P. Smart
VLDB
1993
ACM
112views Database» more  VLDB 1993»
14 years 3 months ago
Specifying and Enforcing Intertask Dependencies
Extensions of the traditional atomic transaction model are needed to support the development of multi-system applications or work ows that access heterogeneous databases and legac...
Paul C. Attie, Munindar P. Singh, Amit P. Sheth, M...