866 search results - page 144 / 174 » Networked Slepian-Wolf: Theory and Algorithms |
176
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
165
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
Recent discovery of the mixture (power-law and exponential) behavior of inter-meeting time distribution of mobile nodes presents new challenge to the problem of mobility modeling ...
172
click to vote
HPDC
2008
IEEE
16 years 19 days ago
2008
IEEE
Self-configuring virtual networks rely on structured P2P routing to provide seamless connectivity among nodes through overlay routing of virtual IP packets, support decentralized...
175
click to vote
PODC
2006
ACM
16 years 4 days ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
185
click to vote
UAI
1997
15 years 7 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...