Sciweavers

849 search results - page 47 / 170
» Completely Non-malleable Schemes
Sort
View
INFOCOM
2003
IEEE
15 years 3 months ago
Cooperative Peer Groups in NICE
Abstract— We present a distributed scheme for trust inference in peer-to-peer networks. Our work is in context of the NICE system, which is a platform for implementing cooperativ...
Seungjoon Lee, Rob Sherwood, Samrat Bhattacharjee
CTRSA
2001
Springer
109views Cryptology» more  CTRSA 2001»
15 years 2 months ago
Uncheatable Distributed Computations
Computationally expensive tasks that can be parallelized are most efficiently completed by distributing the computation among a large number of processors. The growth of the Intern...
Philippe Golle, Ilya Mironov
ICIP
2000
IEEE
15 years 2 months ago
Open-Ended Texture Classification for Terrain Mapping
This paper introduces a new classification scheme called “open-ended texture classification.” The standard approach for texture classification is to use a closed n-class cl...
Rupert Paget, I. Dennis Longstaff
PODC
1997
ACM
15 years 1 months ago
Implementing Wait-Free Objects on Priority-Based Systems
Wait-free objects are often implemented through the use of a \helping scheme", whereby one process \helps" one or more other processes to complete an operation. This pap...
James H. Anderson, Srikanth Ramamurthy, Rohit Jain
CORR
2008
Springer
99views Education» more  CORR 2008»
14 years 9 months ago
Omnidirectional Relay in Wireless Networks
For wireless networks with multiple sources, an omnidirectional relay scheme is developed, where each node can help relay multiple messages in different directions. This is accomp...
Liang-Liang Xie