552 search results - page 16 / 111 » Observable Graphs |
SG
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Bayesian nets (BNs) appeared in the 1980s as a solution to computational and representational problems encountered in knowledge representation of uncertain information. S...
UAI
2004
13 years 9 months ago
2004
This paper concerns the assessment of the effects of actions from a combination of nonexperimental data and causal assumptions encoded in the form of a directed acyclic graph in w...
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...
KDD
2009
ACM
14 years 20 days ago
2009
ACM
Learning temporal graph structures from time series data reveals important dependency relationships between current observations and histories. Most previous work focuses on learn...