Sciweavers

3105 search results - page 324 / 621
» The Path-Packing Structure of Graphs
Sort
View
JMLR
2010
102views more  JMLR 2010»
14 years 11 months ago
Efficient Algorithms for Conditional Independence Inference
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transfor...
Remco R. Bouckaert, Raymond Hemmecke, Silvia Lindn...
JMLR
2010
157views more  JMLR 2010»
14 years 11 months ago
Combining Experiments to Discover Linear Cyclic Models with Latent Variables
We present an algorithm to infer causal relations between a set of measured variables on the basis of experiments on these variables. The algorithm assumes that the causal relatio...
Frederick Eberhardt, Patrik O. Hoyer, Richard Sche...
ML
2010
ACM
193views Machine Learning» more  ML 2010»
14 years 11 months ago
On the eigenvectors of p-Laplacian
Spectral analysis approaches have been actively studied in machine learning and data mining areas, due to their generality, efficiency, and rich theoretical foundations. As a natur...
Dijun Luo, Heng Huang, Chris H. Q. Ding, Feiping N...
SCIENTOMETRICS
2010
131views more  SCIENTOMETRICS 2010»
14 years 11 months ago
Academic team formation as evolving hypergraphs
This paper quantitatively explores the social and socio-semantic patterns of constitution of academic collaboration teams. To this end, we broadly underline two critical features ...
Carla Taramasco, Jean-Philippe Cointet, Camille Ro...
TCS
2010
14 years 11 months ago
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
Samuel Alexandre Vidal