Sciweavers

4897 search results - page 794 / 980
» Trust Modeling for Peer-to-Peer Based Computing Systems
Sort
View
ESCIENCE
2006
IEEE
16 years 17 days ago
Grid Approach to Embarrassingly Parallel CPU-Intensive Bioinformatics Problems
Bioinformatics algorithms such as sequence alignment methods based on profile-HMM (Hidden Markov Model) are popular but CPU-intensive. If large amounts of data are processed, a s...
Heinz Stockinger, Marco Pagni, Lorenzo Cerutti, La...
NSPW
2006
ACM
16 years 14 days ago
PKI design for the real world
What would a PKI look like if it were designed for implementability and deployability rather than strict adherence to a particular theoretical or mathematical model? This paper pr...
Peter Gutmann
ICDCSW
2002
IEEE
15 years 11 months ago
Quantifying Effect of Network Latency and Clock Drift on Time-Driven Key Sequencing
Time-driven Key Sequencing (TKS) is a key management technique that synchronizes the session key used by a set of communicating principals based on time of day. This relatively lo...
Geoffrey G. Xie, Cynthia E. Irvine, Timothy E. Lev...
MDM
2009
Springer
169views Communications» more  MDM 2009»
15 years 11 months ago
Adaptive Query Routing on Distributed Context - The COSINE Framework
Context-awareness has become a desired key feature of today’s mobile systems, yet, its realization still remains a challenge. On the one hand, mobile computing provides great po...
Lukasz Juszczyk, Harald Psaier, Atif Manzoor, Scha...
SPAA
1994
ACM
15 years 10 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher