64 search results - page 2 / 13 » Independency relationships and learning algorithms for singl... |
UAI
1996
13 years 7 months ago
1996
In learning belief networks, the single link lookahead search is widely adopted to reduce the search space. We show that there exists a class of probabilistic domain models which ...
ICDCS
2008
IEEE
14 years 20 days ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
ECSQARU
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. Although we can build a belief network starting from any ordering of its variables, its structure depends heavily on the ordering being selected: the topology of the netw...
COCOON
2007
Springer
14 years 12 days ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
WSDM
2012
ACM
12 years 1 months ago
2012
ACM
Traditionally, research about trust assumes a single type of trust between users. However, trust, as a social concept, inherently has many facets indicating multiple and heterogen...