Sciweavers

359 search results - page 45 / 72
» Multi-state Directed Acyclic Graphs
Sort
View
101
Voted
ISI
2007
Springer
14 years 11 months ago
Outil autonome de surveillance de grilles
ABSTRACT. Grids have become very complex. It makes the deployment and maintenance of systems a difficult task requiring lots of efforts from administrators. We believe that peer-t...
Laurent Baduel, Satoshi Matsuoka
JMLR
2010
139views more  JMLR 2010»
14 years 6 months ago
Causal learning without DAGs
Causal learning methods are often evaluated in terms of their ability to discover a true underlying directed acyclic graph (DAG) structure. However, in general the true structure ...
David Duvenaud, Daniel Eaton, Kevin P. Murphy, Mar...
IPPS
2007
IEEE
15 years 6 months ago
Minimum number of wavelengths equals load in a DAG without internal cycle
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
Jean-Claude Bermond, Michel Cosnard
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
15 years 1 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
90
Voted
NIPS
2003
15 years 1 months ago
Kernels for Structured Natural Language Data
This paper devises a novel kernel function for structured natural language data. In the field of Natural Language Processing, feature extraction consists of the following two ste...
Jun Suzuki, Yutaka Sasaki, Eisaku Maeda