Sciweavers

123 search results - page 19 / 25
» The minimum Manhattan network problem: Approximations and ex...
Sort
View
JMLR
2010
149views more  JMLR 2010»
13 years 1 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
ICC
2007
IEEE
102views Communications» more  ICC 2007»
14 years 1 months ago
Power Allocation in Multi-Carrier Networks with Unicast and Multicast Services
—Since the provision of both unicast and multicast services is expected for the next generation of multi-carrier wireless systems, the allocation of resources for this combinatio...
Yuri C. B. Silva, Anja Klein
INFOCOM
2006
IEEE
14 years 23 days ago
Trade-Off Curves for QoS Routing
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
Piet Van Mieghem, Lieven Vandenberghe
IPPS
1998
IEEE
13 years 11 months ago
Multicasting and Broadcasting in Large WDM Networks
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
Weifa Liang, Hong Shen
IWCMC
2009
ACM
14 years 1 months ago
Optimal cooperative spectrum sensing in cognitive sensor networks
This paper addresses the problem of optimal cooperative spectrum sensing in a cognitive-enabled sensor network where cognitive sensors can cooperate in the sensing of the spectrum...
Hai Ngoc Pham, Yan Zhang, Paal E. Engelstad, Tor S...