Computer worms are a serious problem. Much research has been done to detect and contain worms. One major deficiency in most research is that the claims are supported by theoretic...
Senthilkumar G. Cheetancheri, Denys L. Ma, Karl N....
By the fundamental theorem of symmetric polynomials, if P Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(1, . . . , n), where 1, . . . , n are the elementary symmet...
The number of computational trust models has been increasing rapidly in recent years, yet their applications for automating trust evaluation are still limited. The main obstacle i...
Cultural profiling involves a complex interplay of multiple dimensions that are virtually impossible to wholly address. This paper explores several cultural (nationality and its as...
Emmanuel G. Blanchard, Marguerite Roy, Susanne P. ...
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...