3809 search results - page 246 / 762 » Randomized Broadcast in Networks |
153
click to vote
APPROX
2000
Springer
15 years 10 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
171
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
216
click to vote
JSAC
2008
15 years 6 months ago
2008
We consider the downlink of a wireless system with an M-antenna base station and K single-antenna users. A limited feedback-based scheduling and precoding scenario is considered th...
194
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
188
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...