<--- Back to Details
First PageDocument Content
Semantic similarity / Graph / Path / Directed graph / Graph theory / Computational linguistics / Graph connectivity
Date: 2008-03-05 13:49:35
Semantic similarity
Graph
Path
Directed graph
Graph theory
Computational linguistics
Graph connectivity

Learning to Walk Structured Text Networks CMU-LTI[removed]Einat Minkov and William W. Cohen

Add to Reading List

Source URL: www.cs.cmu.edu

Download Document from Source Website

File Size: 143,22 KB

Share Document on Facebook

Similar Documents

Conflict-Directed Graph Coverage Daniel Schwartz-Narbonne1 , Martin Sch¨af2 , Dejan Jovanovi´c2 , Philipp R¨ ummer3 , and Thomas Wies1 1

Conflict-Directed Graph Coverage Daniel Schwartz-Narbonne1 , Martin Sch¨af2 , Dejan Jovanovi´c2 , Philipp R¨ ummer3 , and Thomas Wies1 1

DocID: 1xVY3 - View Document

Lower and Upper bounds for Online Directed Graph Exploration Klaus-Tycho Förster  ETH Zurich – Distributed Computing – www.disco.ethz.ch

Lower and Upper bounds for Online Directed Graph Exploration Klaus-Tycho Förster ETH Zurich – Distributed Computing – www.disco.ethz.ch

DocID: 1vj8s - View Document

Conflict-Directed Graph Coverage Daniel Schwartz-Narbonne1 , Martin Sch¨af2 , Dejan Jovanovi´c2 , Philipp R¨ ummer3 , and Thomas Wies1 1

Conflict-Directed Graph Coverage Daniel Schwartz-Narbonne1 , Martin Sch¨af2 , Dejan Jovanovi´c2 , Philipp R¨ ummer3 , and Thomas Wies1 1

DocID: 1sVcM - View Document

Network Analysis and Modeling Lectures 1 and 2 Prof. Aaron Clauset 1

Network Analysis and Modeling Lectures 1 and 2 Prof. Aaron Clauset 1

DocID: 1rmNc - View Document

Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains Isabelle Stanton∗ Ali Pinar† UC Berkeley Sandia National Laboratories‡

Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains Isabelle Stanton∗ Ali Pinar† UC Berkeley Sandia National Laboratories‡

DocID: 1rdvb - View Document