Sciweavers

557 search results - page 52 / 112
» On the convergence time of distributed quantized averaging a...
Sort
View
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
13 years 9 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
SRDS
2010
IEEE
13 years 5 months ago
Fault-Tolerant Aggregation for Dynamic Networks
Data aggregation is a fundamental building block of modern distributed systems. Averaging based approaches, commonly designated gossip-based, are an important class of aggregation ...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
WSC
2008
13 years 10 months ago
A simulation based approach for dock allocation in a food distribution center
This research endeavor focused on the warehouse receiving process at a large food distribution center, which comprises of trucks with goods reaching the destination warehouse, unl...
Balagopal Gopakumar, Suvarna Sundaram, Shengyong W...
DAIS
2010
13 years 9 months ago
gradienTv: Market-Based P2P Live Media Streaming on the Gradient Overlay
This paper presents gradienTv, a distributed, market-based approach to live streaming. In gradienTv, multiple streaming trees are constructed using a market-based approach, such th...
Amir H. Payberah, Jim Dowling, Fatemeh Rahimian, S...
ATAL
2008
Springer
13 years 9 months ago
A best-first anytime algorithm for computing optimal coalition structures
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition va...
Chattrakul Sombattheera, Aditya Ghose