256 search results - page 26 / 52 » Separation of NP-Completeness Notions |
147
click to vote
TIFS
2008
14 years 11 months ago
2008
Abstract-- It has recently been discovered that using pseudorandom sequences as carriers in spread-spectrum techniques for data-hiding is not at all a sufficient condition for ensu...
104
click to vote
HYBRID
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we present a new design methodology for synchronous reactive systems, based on a clear separation between control and data flow parts. This methodology allows to fa...
106
click to vote
CSFW
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract. The focus of work on information flow security has primarily been on definitions of security in asynchronous systems models. This paper considers systems with scheduler...
107
click to vote
ECAL
1995
Springer
15 years 3 months ago
1995
Springer
Arti cial Life and the more general area of Complex Systems does not have a uni ed theoretical framework although most theoretical work in these areas is based on simulation. This ...
103
click to vote
MST
2010
14 years 10 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...