Sciweavers

1722 search results - page 3 / 345
» On the sample mean of graphs
Sort
View
UAI
2008
13 years 7 months ago
AND/OR Importance Sampling
The paper introduces an AND/OR importance sampling scheme for probabilistic graphical models. In contrast to conventional importance sampling, AND/OR importance sampling caches sa...
Vibhav Gogate, Rina Dechter
CVPR
2012
IEEE
11 years 8 months ago
Non-negative low rank and sparse graph for semi-supervised learning
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
Liansheng Zhuang, Haoyuan Gao, Zhouchen Lin, Yi Ma...
FAW
2009
Springer
177views Algorithms» more  FAW 2009»
14 years 11 days ago
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong ...
CORR
2002
Springer
135views Education» more  CORR 2002»
13 years 5 months ago
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
András A. Benczúr, David R. Karger