1600 search results - page 270 / 320 » Clustering for opportunistic communication |
109
click to vote
IPPS
1996
IEEE
15 years 4 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...
81
Voted
GLOBECOM
2007
IEEE
15 years 4 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...
99
Voted
SIGCOMM
2010
ACM
15 years 28 days 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&...
125
Voted
SIGCOMM
2010
ACM
15 years 28 days 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...
110
Voted
ALGORITHMICA
2006
15 years 24 days 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...