Sciweavers

4280 search results - page 828 / 856
» Mechanisms for information elicitation
Sort
View
ESORICS
2010
Springer
13 years 11 months ago
Optimistic Fair Exchange with Multiple Arbiters
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...
Alptekin Küpçü, Anna Lysyanskaya
HPDC
2010
IEEE
13 years 11 months ago
Biocompute: towards a collaborative workspace for data intensive bio-science
The explosion of data in the biological community demands the development of more scalable and flexible portals for bioinformatic computation. To address this need, we put forth c...
Rory Carmichael, Patrick Braga-Henebry, Douglas Th...
CCGRID
2010
IEEE
13 years 10 months ago
FaReS: Fair Resource Scheduling for VMM-Bypass InfiniBand Devices
In order to address the high performance I/O needs of HPC and enterprise applications, modern interconnection fabrics, such as InfiniBand and more recently, 10GigE, rely on network...
Adit Ranadive, Ada Gavrilovska, Karsten Schwan
ADHOC
2010
123views more  ADHOC 2010»
13 years 10 months ago
An analysis of the lifetime of OLSR networks
The Optimized Link State Routing (OLSR) protocol is a well-known route discovery protocol for ad-hoc networks. OLSR optimizes the flooding of link state information through the ne...
Jan-Maarten Verbree, Maurits de Graaf, Johann Huri...
ADHOC
2007
144views more  ADHOC 2007»
13 years 10 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac