Sciweavers

4110 search results - page 424 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
IPPS
2010
IEEE
15 years 4 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
16 years 7 months ago
Approximate clustering via core-sets
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
IPPS
2007
IEEE
16 years 1 months ago
An Artificial Immune System for Heterogeneous Multiprocessor Scheduling with Task Duplication
In this study, we investigate the task scheduling problem in heterogeneous computing environments and propose a novel scheduling algorithm, called the Artificial Immune System wit...
Young Choon Lee, Albert Y. Zomaya
CVPR
2009
IEEE
17 years 1 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
VTC
2006
IEEE
147views Communications» more  VTC 2006»
16 years 25 days ago
Performance Analysis of Scheduling Algorithms for VoIP Services in IEEE 802.16e Systems
There are several scheduling algorithms for Voice over IP (VoIP) services in IEEE 802.16e systems, such as unsolicited grant service (UGS), real-time polling service (rtPS), and ex...
Howon Lee, Taesoo Kwon, Dong-Ho Cho, Geunhwi Lim, ...