Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
Derek Rayside, Steve Reuss, Erik Hedges, Kostas Ko...
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
Vikas Sindhwani, Jianying Hu, Aleksandra Mojsilovi...
- Ever-increasing demands of space missions for data returns from their limited processing and communications resources have made the traditional approach of data gathering, data c...
Rajagopal Subramaniyan, Vikas Aggarwal, Adam Jacob...
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
Though most approaches to protein comparison are based on their structure, several studies produced evidence of a strict correlation between the surface characteristics of protein...
Lorenzo Baldacci, Matteo Golfarelli, Alessandra Lu...