8825 search results - page 328 / 1765 » All for one or one for all |
106
click to vote
IH
2004
Springer
15 years 7 months ago
2004
Springer
In this paper, we consider how to hide information into finite state machine (FSM), one of the popular computation models. The key advantage of hiding information in FSM is that t...
150
click to vote
NMR
2004
Springer
15 years 7 months ago
2004
Springer
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
106
click to vote
PAKDD
2004
ACM
15 years 7 months ago
2004
ACM
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
116
click to vote
PVM
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
105
click to vote
RAID
2004
Springer
15 years 7 months ago
2004
Springer
We present a formal framework for the analysis of intrusion detection systems (IDS) that employ declarative rules for attack recognition, e.g. specification-based intrusion detect...