251 search results - page 47 / 51 » Distributed algorithms for edge dominating sets |
TPDS
2008
14 years 9 months ago
2008
To construct an efficient overlay network, the information of underlay is important. We consider using end-to-end measurement tools such as traceroute to infer the underlay topolog...
89
Voted
UAI
2008
14 years 11 months ago
2008
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
115
click to vote
SWAT
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
106
Voted
BMCBI
2005
14 years 9 months ago
2005
Background: Two central problems in computational biology are the determination of the alignment and phylogeny of a set of biological sequences. The traditional approach to this p...
108
click to vote
AI
2010
Springer
14 years 9 months ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...