Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
Zhenjie Zhang, Yin Yang, Anthony K. H. Tung, Dimit...
: Service discovery has been recognised as an important aspect in the development of service centric systems, i.e., software systems which deploy web services. To develop such syst...
Alexander Kozlenkov, George Spanoudakis, Andrea Zi...
This paper presents a surface reconstruction algorithm that can recover correct shape geometry as well as its unknown topology from both volumetric images and unorganized point cl...
Motivation: There has been considerable interest in developing computational techniques for inferring genetic regulatory networks from whole-genome expression profiles. When expre...
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...