Sciweavers

1519 search results - page 69 / 304
» Network Partitioning of Data Parallel Computations
Sort
View
IPPS
2005
IEEE
14 years 2 months ago
Modeling and Taming Parallel TCP on the Wide Area Network
— Parallel TCP flows are broadly used in the high performance distributed computing community to enhance network throughput, particularly for large data transfers. Previous rese...
Dong Lu, Yi Qiao, Peter A. Dinda, Fabián E....
SDM
2009
SIAM
251views Data Mining» more  SDM 2009»
14 years 6 months ago
High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic.
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
Alok N. Choudhary, Arifa Nisar, Waseem Ahmad, Wei-...
IPPS
1996
IEEE
14 years 1 months ago
A Parallel Solution to the Extended Set Union Problem with Unlimited Backtracking
In this paper, we study on the EREW-PRAM model a parallel solution to the extended set union problem with unlimited backtracking which maintains a dynamic partition of an n-elemen...
Maria Cristina Pinotti, Vincenzo A. Crupi, Sajal K...
ISPAN
1999
IEEE
14 years 1 months ago
Distributed Clustering for Ad Hoc Networks
A Distributed Clustering Algorithm DCA and a Distributed Mobility-Adaptive Clustering DMAC algorithm are presented that partition the nodes of a fully mobile network ad hoc networ...
Stefano Basagni
DATAMINE
1999
113views more  DATAMINE 1999»
13 years 8 months ago
A Fast Parallel Clustering Algorithm for Large Spatial Databases
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
Xiaowei Xu, Jochen Jäger, Hans-Peter Kriegel