Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
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...
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
This research investigates distributed clustering scheme and proposes a cluster-based routing protocol for DelayTolerant Mobile Networks (DTMNs). The basic idea is to distributivel...
Analysis of a comprehensive set of features extracted from blogs for prediction of movie sales is presented. We use correlation, clustering and time-series analysis to study which...
Eldar Sadikov, Aditya G. Parameswaran, Petros Vene...