Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
— We present the design of a Network Forensic Alliance (NFA), to allow multiple administrative domains (ADs) to jointly locate the origin of epidemic spreading attacks. ADs in th...
Yinglian Xie, Vyas Sekar, Michael K. Reiter, Hui Z...
Algorithmic skeletons can be used to write architecture independent programs, shielding application developers from the details of a parallel implementation. In this paper, we pre...
This paper presents an evaluation of partial and intermittent (PI) resource support on JXTA and proposes a new MANET rendezvous service, optimized for handling PI resources. JXTA ...
Rodolfo Oliveira, Luis Bernardo, Nelson Ruivo, Pau...
In case the objective function to be minimized is not known analytically and no assumption can be made about the single extremum, global optimization (GO) methods must be used. Pap...