339 search results - page 9 / 68 » Is the Euclidean algorithm optimal among its peers |
SEMWEB
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Reputation in P2P networks is an important tool to encourage cooperation among peers. It is based on ranking of peers according to their past behaviour. In large-scale real world ...
CONEXT
2006
ACM
14 years 1 months ago
2006
ACM
We consider the case of a virtual world of peers that are organized in an overlay built by Delaunay Triangulation. Application layer routing is used to determine the path taken in...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Over the past few years, a number of distributed algorithms have been developed for integrating the measurements acquired by a wireless sensor network. Among them, average consensu...