Sciweavers

93 search results - page 2 / 19
» Fast and Efficient Total Exchange on Two Clusters
Sort
View
GLOBECOM
2010
IEEE
13 years 8 months ago
Filter-and-Forward Distributed Beamforming for Two-Way Relay Networks with Frequency Selective Channels
Abstract-- A new approach to distributed cooperative beamforming in two-way half-duplex relay networks with frequency selective channels is proposed. In our scheme, two transceiver...
Haihua Chen, Alex B. Gershman, Shahram Shahbazpana...
CCGRID
2010
IEEE
13 years 8 months ago
Low-Cost Tuning of Two-Step Algorithms for Scheduling Mixed-Parallel Applications onto Homogeneous Clusters
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...
Sascha Hunold
PRL
2010
188views more  PRL 2010»
13 years 5 months ago
A fast divisive clustering algorithm using an improved discrete particle swarm optimizer
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
Liang Feng, Ming-Hui Qiu, Yu-Xuan Wang, Qiao-Liang...
CIKM
2006
Springer
14 years 24 days ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
14 years 5 days ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...