Search Results for author: Leonid Peshkin

Found 2 papers, 0 papers with code

Matroids Hitting Sets and Unsupervised Dependency Grammar Induction

no code implementations24 May 2017 Nicholas Harvey, Vahab Mirrokni, David Karger, Virginia Savova, Leonid Peshkin

This paper formulates a novel problem on graphs: find the minimal subset of edges in a fully connected graph, such that the resulting graph contains all spanning trees for a set of specifed sub-graphs.

Dependency Grammar Induction

Cannot find the paper you are looking for? You can Submit a new open access paper.