Sciweavers

1600 search results - page 134 / 320
» Clustering for opportunistic communication
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
Back-Pressure Routing for Intermittently Connected Networks
—We study a mobile wireless network where groups or clusters of nodes are intermittently connected via mobile “carriers” (the carriers provide connectivity over time among di...
Jung Ryu, Lei Ying, Sanjay Shakkottai
ICPP
2000
IEEE
15 years 10 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
EWSN
2004
Springer
16 years 6 months ago
Improving the Energy Efficiency of Directed Diffusion Using Passive Clustering
Directed diffusion is a prominent example of data-centric routing based on application layer data and purely local interactions. In its functioning it relies heavily on network-wid...
Andreas Köpke, Christian Frank, Holger Karl, ...
FPGA
2010
ACM
294views FPGA» more  FPGA 2010»
15 years 11 months ago
Axel: a heterogeneous cluster with FPGAs and GPUs
This paper describes a heterogeneous computer cluster called Axel. Axel contains a collection of nodes; each node can include multiple types of accelerators such as FPGAs (Field P...
Kuen Hung Tsoi, Wayne Luk
EUROPAR
2001
Springer
15 years 11 months ago
Self-Organizing Hierarchical Cluster Timestamps
Distributed-system observation tools require an efficient data structure to store and query the partial-order of execution. Such data structures typically use vector timestamps to...
Paul A. S. Ward, David J. Taylor