Sciweavers

380 search results - page 24 / 76
» Operation-valency and the cost of coordination
Sort
View
NIPS
2001
13 years 11 months ago
Spectral Relaxation for K-means Clustering
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 ...
CRV
2011
IEEE
309views Robotics» more  CRV 2011»
12 years 10 months ago
Optimal Alignment of 3D Data for Spatial Discretization
—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, ...
PODC
2003
ACM
14 years 3 months ago
On a network creation game
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...
VTC
2010
IEEE
219views Communications» more  VTC 2010»
13 years 8 months ago
Decentralized Base Station Processing for Multiuser MIMO Downlink CoMP
—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...
Winston W. L. Ho, Tony Q. S. Quek, Sumei Sun
COORDINATION
2010
Springer
13 years 8 months ago
Efficient Session Type Guided Distributed Interaction
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...