Synchronizing Parallel Geometric Algorithms on Multi-core Machines

Author(s):  
Joel Fuentes ◽  
Fei Luo ◽  
Isaac D. Scherson
Keyword(s):  
Algorithmica ◽  
1990 ◽  
Vol 5 (1-4) ◽  
pp. 155-177 ◽  
Author(s):  
C. S. Jeong ◽  
D. T. Lee
Keyword(s):  

2005 ◽  
Vol 35 (3) ◽  
pp. 627-646 ◽  
Author(s):  
Bernard Chazelle ◽  
Ding Liu ◽  
Avner Magen
Keyword(s):  

2009 ◽  
Vol 20 (02) ◽  
pp. 361-377
Author(s):  
DANNY Z. CHEN ◽  
MARK A. HEALY ◽  
CHAO WANG ◽  
BIN XU

In this paper, we present efficient geometric algorithms for the discrete constrained 1-D K-means clustering problem and extend our solutions to the continuous version of the problem. One key clustering constraint we consider is that the maximum difference in each cluster cannot be larger than a given threshold. These constrained 1-D K-means clustering problems appear in various applications, especially in intensity-modulated radiation therapy (IMRT). Our algorithms improve the efficiency and accuracy of the heuristic approaches used in clinical IMRT treatment planning.


Author(s):  
Erik D. Demaine ◽  
Sándor P. Fekete ◽  
Christian Scheffer ◽  
Arne Schmidt

Author(s):  
Martin Grötschel ◽  
László Lovász ◽  
Alexander Schrijver

Sign in / Sign up

Export Citation Format

Share Document