Sciweavers

115 search results - page 18 / 23
» cj 2008
Sort
View
CJ
2004
93views more  CJ 2004»
13 years 7 months ago
An Architecture for Kernel-Level Verification of Executables at Run Time
Digital signatures have been proposed by several researchers as a way of preventing execution of malicious code. In this paper we propose a general architecture for performing the...
Luigi Catuogno, Ivan Visconti
CJ
2004
90views more  CJ 2004»
13 years 7 months ago
Extended k-Nearest Neighbours based on Evidence Theory
An evidence theoretic classification method is proposed in this paper. In order to classify a pattern we consider its neighbours, which are taken as parts of a single source of ev...
Hui Wang, David A. Bell
CJ
2002
67views more  CJ 2002»
13 years 7 months ago
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...
CJ
1998
63views more  CJ 1998»
13 years 7 months ago
Protecting IT Systems from Cyber Crime
Large-scale commercial, industrial and financial operations are becoming ever more interdependent, and ever more dependent on IT. At the same time, the rapidly growing interconnec...
R. Benjamin, B. Gladman, Brian Randell
CJ
1999
95views more  CJ 1999»
13 years 7 months ago
Two Kinds of Probabilistic Induction
Problems in probabilistic induction are of two general kinds. In the first, we have a linearly ordered sequence of symbols that must be extrapolated. In the second we want to extr...
Ray J. Solomonoff