736 search results - page 44 / 148 » Approximating the Number of Network Motifs |
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
Over the past few years, a number of approximate inference algorithms for networked data have been put forth. We empirically compare the performance of three of the popular algori...
FOCS
1996
IEEE
15 years 2 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the ...
160
click to vote
VLDB
2006
ACM
15 years 10 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
103
click to vote
TSP
2010
14 years 4 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...