Sciweavers

1161 search results - page 231 / 233
» Approximation schemes for clustering problems
Sort
View
HPDC
2003
IEEE
14 years 22 days ago
Distributed Pagerank for P2P Systems
This paper defines and describes a fully distributed implementation of Google’s highly effective Pagerank algorithm, for “peer to peer”(P2P) systems. The implementation is ...
Karthikeyan Sankaralingam, Simha Sethumadhavan, Ja...
ICASSP
2009
IEEE
13 years 11 months ago
Optimized opportunistic multicast scheduling (OMS) over heterogeneous cellular networks
Optimized opportunistic multicast scheduling (OMS) has been studied previously by the authors for homogeneous cellular networks, where the problem of efficiently transmitting a co...
Tze-Ping Low, Man-On Pun, Yao-Win Peter Hong, C.-C...
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
13 years 8 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh
CCR
2006
122views more  CCR 2006»
13 years 7 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
CPHYSICS
2007
89views more  CPHYSICS 2007»
13 years 7 months ago
Numerical differentiation of experimental data: local versus global methods
In the context of the analysis of measured data, one is often faced with the task to differentiate data numerically. Typically, this occurs when measured data are concerned or dat...
Karsten Ahnert, Markus Abel