—The conventional K-Means clustering algorithm must know the number of clusters in advance and the clustering result is sensitive to the selection of the initial cluster centroid...
Jing Xiao, YuPing Yan, Ying Lin, Ling Yuan, Jun Zh...
Clustering is the process of subdividing an input data set into a desired number of subgroups so that members of the same subgroup are similar and members of different subgroups h...
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Background: The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include a...
Large–scale parallel applications performing global synchronization may spend a significant amount of execution time waiting for the completion of a barrier operation. Conseque...