Sciweavers

17760 search results - page 323 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
DATAMINE
2006
89views more  DATAMINE 2006»
15 years 6 months ago
Scalable Clustering Algorithms with Balancing Constraints
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
Arindam Banerjee, Joydeep Ghosh
WWW
2007
ACM
16 years 7 months ago
Expertise networks in online communities: structure and algorithms
Web-based communities have become important places for people to seek and share expertise. We find that networks in these communities typically differ in their topology from other...
Jun Zhang, Mark S. Ackerman, Lada A. Adamic
ATAL
2009
Springer
16 years 1 months ago
Decentralised coordination of continuously valued control parameters using the max-sum algorithm
In this paper we address the problem of decentralised coordination for agents that must make coordinated decisions over continuously valued control parameters (as is required in m...
Ruben Stranders, Alessandro Farinelli, Alex Rogers...
ATAL
2007
Springer
16 years 1 months ago
A globally optimal algorithm for TTD-MDPs
In this paper, we discuss the use of Targeted Trajectory Distribution Markov Decision Processes (TTD-MDPs)—a variant of MDPs in which the goal is to realize a specified distrib...
Sooraj Bhat, David L. Roberts, Mark J. Nelson, Cha...
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
16 years 6 days ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella