The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
Hongyuan Zha, Xiaofeng He, Chris H. Q. Ding, Ming ...
—We present an algorithm that finds the rotation which best aligns a given configuration of directions on an unsorted set of directions. Using a cost function that we derive in...
Benjamin Huhle, Timo Schairer, Andreas Schilling, ...
We introduce a novel game that models the creation of Internet-like networks by selfish node-agents without central design or coordination. Nodes pay for the links that they esta...
Alex Fabrikant, Ankur Luthra, Elitza N. Maneva, Ch...
—Coordinated multi-point transmission/reception (CoMP), in which base stations (BSs) cooperate during the downlink, has been identified as a tool for improving user rates and mi...
Abstract. Recently, there has been much interest in multi-party session types (MPSTs) as a means of rigorously specifying protocols for interaction among multiple distributed parti...
K. C. Sivaramakrishnan, Karthik Nagaraj, Lukasz Zi...