Sciweavers

95 search results - page 13 / 19
» CORR 2012
Sort
View
CORR
2012
Springer
195views Education» more  CORR 2012»
12 years 5 months ago
Multiple-Source Shortest Paths in Embedded Graphs
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
Sergio Cabello, Erin W. Chambers, Jeff Erickson
CORR
2012
Springer
184views Education» more  CORR 2012»
12 years 5 months ago
Noisy-OR Models with Latent Confounding
Given a set of experiments in which varying subsets of observed variables are subject to intervention, we consider the problem of identifiability of causal models exhibiting late...
Antti Hyttinen, Frederick Eberhardt, Patrik O. Hoy...
CORR
2012
Springer
272views Education» more  CORR 2012»
12 years 5 months ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...
CORR
2012
Springer
187views Education» more  CORR 2012»
12 years 5 months ago
Sequential Inference for Latent Force Models
Latent force models (LFMs) are hybrid models combining mechanistic principles with non-parametric components. In this article, we shall show how LFMs can be equivalently formulate...
Jouni Hartikainen, Simo Särkkä
CORR
2012
Springer
195views Education» more  CORR 2012»
12 years 5 months ago
Ranking hubs and authorities using matrix functions
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
Michele Benzi, Ernesto Estrada, Christine Klymko