Optimal geometric algorithms for digitized images on arrays with reconfigurable optical buses

2006 ◽  
Vol 30 (7) ◽  
pp. 425-434
Author(s):  
Chin-Hsiung Wu ◽  
Shi-Jinn Horng ◽  
Yuh-Rau Wang ◽  
Horng-Ren Tsai
Keyword(s):  
Geometric Algorithms ◽  
Digitized Images ◽  
Optical Buses

Parallel geometric algorithms on a mesh-connected computer

Algorithmica ◽  
1990 ◽  
Vol 5 (1-4) ◽  
pp. 155-177 ◽  
Author(s):  
C. S. Jeong ◽  
D. T. Lee
Keyword(s):  
Geometric Algorithms

MUTUAL EXCLUSION ON OPTICAL BUSES

2002 ◽  
Vol 12 (03n04) ◽  
pp. 341-358
Author(s):  
KRISHNA M. KAVI ◽  
DINESH P. MEHTA
Keyword(s):  
Mutual Exclusion ◽  
Two Dimensional ◽  
One Dimensional ◽  
Dimensional Array ◽  
Propagation Delays ◽  
Optical Buses ◽  
The One

This paper presents two algorithms for mutual exclusion on optical bus architectures including the folded one-dimensional bus, the one-dimensional array with pipelined buses (1D APPB), and the two-dimensional array with pipelined buses (2D APPB). The first algorithm guarantees mutual exclusion, while the second guarantees both mutual exclusion and fairness. Both algorithms exploit the predictability of propagation delays in optical buses.

scholarly journals Sublinear Geometric Algorithms

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

GEOMETRIC ALGORITHMS FOR THE CONSTRAINED 1-D K-MEANS CLUSTERING PROBLEMS AND IMRT APPLICATIONS

2009 ◽  
Vol 20 (02) ◽  
pp. 361-377
Author(s):  
DANNY Z. CHEN ◽  
MARK A. HEALY ◽  
CHAO WANG ◽  
BIN XU
Keyword(s):  
Radiation Therapy ◽  
Treatment Planning ◽  
Intensity Modulated Radiation Therapy ◽  
Geometric Algorithms ◽  
Maximum Difference ◽  
Continuous Version ◽  
Heuristic Approaches ◽  
Clustering Problem ◽  
Intensity Modulated ◽  
Clustering Problems

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.

Sign in / Sign up

Export Citation Format

Share Document