Search For:

Displaying 1-2 out of 2 total
Multi-party k-Means Clustering with Privacy Consideration
Found in: Parallel and Distributed Processing with Applications, International Symposium on
By Teng-Kai Yu, D.T. Lee, Shih-Ming Chang, Justin Zhan
Issue Date:September 2010
pp. 200-207
The k-means clustering algorithm is a widely used scheme to solve the clustering problem which classifies a given set of n data points in m-dimensional space into k clusters, whose centers are obtained by the centroids of the points in the same cluster. Th...
 
Time Convex Hull with a Highway
Found in: International Symposium on Voronoi Diagrams in Science and Engineering
By Teng-Kai Yu, D. T. Lee
Issue Date:July 2007
pp. 240-250
We consider the problem of computing the time convex hull of a set of points in the presence of a straight-line highway in the plane. The traveling speed in the plane is assumed to be much slower than that along the highway. The shortest time path between ...
 
 1