866 search results - page 115 / 174 » Networked Slepian-Wolf: Theory and Algorithms |
201
click to vote
VTC
2007
IEEE
16 years 17 days ago
2007
IEEE
Opportunistic user access scheduling enhances the capacity of wireless networks by exploiting the multi user diversity. When frame aggregation is used, opportunistic schemes are no...
153
click to vote
WG
1995
Springer
15 years 9 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
319
click to vote
CONIELECOMP
2011
IEEE
14 years 10 months ago
2011
IEEE
—We propose a new multi-hop routing protocol for wireless sensor networks, suited for monitoring and control applications. The aim of this research is to adapt flat and hierarch...
165
click to vote
SOCIALCOM
2010
15 years 4 months ago
2010
It is a widely held belief among designers of social tagging systems that tag clouds represent a useful tool for navigation. This is evident in, for example, the increasing number ...
154
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...