736 search results - page 27 / 148 » Approximating the Number of Network Motifs |
UAI
1994
14 years 11 months ago
1994
We show how to nd a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the rst step in the method of conditioning for inference....
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
106
click to vote
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in an Euclidean plane, our objective is to place minimum nu...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We generalize the concept of multiuser peer-to-peer (MUP2P) relay networks to that of a multi-group multicasting (MGM) relay network where each source may broadcast its message to...
IJCV
2012
13 years 7 days ago
2012
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...