1600 search results - page 270 / 320 » Clustering for opportunistic communication |
IPPS
1996
IEEE
14 years 3 months ago
1996
IEEE
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
Ad-hoc networks and sensor networks, where nodes communicate with each other without fixed infrastructure, are of great importance for many industrial, environmental, and safety-r...
SIGCOMM
2010
ACM
13 years 11 months ago
2010
ACM
Cloud data centers host diverse applications, mixing workloads that require small predictable latency with others requiring large sustained throughput. In this environment, today&...
SIGCOMM
2010
ACM
13 years 11 months ago
2010
ACM
Recently, there has been much excitement in the research community over using social networks to mitigate multiple identity, or Sybil, attacks. A number of schemes have been propo...
ALGORITHMICA
2006
13 years 11 months ago
2006
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...