Sciweavers

866 search results - page 72 / 174
» Networked Slepian-Wolf: Theory and Algorithms
Sort
View
MOBICOM
2003
ACM
15 years 11 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
CIKM
2008
Springer
15 years 8 months ago
Mining social networks using heat diffusion processes for marketing candidates selection
Social Network Marketing techniques employ pre-existing social networks to increase brands or products awareness through word-of-mouth promotion. Full understanding of social netw...
Hao Ma, Haixuan Yang, Michael R. Lyu, Irwin King
SPAA
2009
ACM
16 years 1 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
PODS
2010
ACM
215views Database» more  PODS 2010»
15 years 11 months ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
ATAL
2009
Springer
16 years 28 days 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...