23988 search results - page 4186 / 4798 » Social Network Computing |
188
click to vote
IPTPS
2003
Springer
16 years 14 days ago
2003
Springer
This paper addresses a simple, yet fundamental question in the design of peer-to-peer systems: What does it mean when we say “availability” and how does this understanding imp...
200
Voted
IPTPS
2003
Springer
16 years 14 days ago
2003
Springer
– In this paper, we first describe the concept of data overlay, which is a mechanism to implement arbitrary data structure on top of any structured P2P DHT. With this ion, we dev...
205
Voted
IPTPS
2003
Springer
16 years 14 days ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
195
click to vote
3DPVT
2002
IEEE
16 years 7 days ago
2002
IEEE
We consider the problem of computing stereo correspondence for scenes dense in physical structure, such as a bouquet of flowers. Boundaries are then space curves, formally govern...
198
click to vote
RTAS
2002
IEEE
16 years 6 days ago
2002
IEEE
Delay variations (jitter) in computations and communications cause degradation of performance in control applications. There are many sources of jitter, including variations in ex...