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

DOI10.1142/S0129054109006619zbMath1178.68399OpenAlexW2100345790MaRDI QIDQ3634189

Chao Wang, Danny Z. Chen, Mark A. Healy, Bin Xu

Publication date: 23 June 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054109006619

zbMATH Keywords

matrix search algorithmstaircase-Monge propertyIntensity-Modulated Radiation Therapy

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Medical applications (general) (92C50)

Cites Work

• Geometric applications of a matrix-searching algorithm
• Improved complexity bounds for location problems on the real line
• How fast is the \(k\)-means method?
• Optimal quantization by matrix searching
• Centroidal Voronoi Tessellations: Applications and Algorithms
• Quantization
• Least squares quantization in PCM

This page was built for publication: GEOMETRIC ALGORITHMS FOR THE CONSTRAINED 1-D K-MEANS CLUSTERING PROBLEMS AND IMRT APPLICATIONS