1600 search results - page 270 / 320 » Clustering for opportunistic communication |
159
click to vote
IPPS
1996
IEEE
15 years 10 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...
140
click to vote
GLOBECOM
2007
IEEE
15 years 10 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...
157
click to vote
SIGCOMM
2010
ACM
15 years 6 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&...
183
click to vote
SIGCOMM
2010
ACM
15 years 6 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...
155
click to vote
ALGORITHMICA
2006
15 years 6 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...