6 citations · 10 across the 4 of their papers we have counts for
4 papers
Matroids Hitting Sets and Unsupervised Dependency Grammar Induction
Nicholas Harvey, Vahab Mirrokni, David Karger +2
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…
Reinforcement Learning for Adaptive Routing
Leonid Peshkin, Virginia Savova
Reinforcement learning means learning a policy--a mapping of observations into actions--based on feedback from the environment. The learning can be viewed as browsing a set of poli…
Dependency Parsing with Dynamic Bayesian Network
Virginia Savova, Leonid Peshkin
Exact parsing with finite state automata is deemed inappropriate because of the unbounded non-locality languages overwhelmingly exhibit. We propose a way to structure the parsing t…
Part-of-Speech Tagging with Minimal Lexicalization
Virginia Savova, Leonid Peshkin
We use a Dynamic Bayesian Network to represent compactly a variety of sublexical and contextual features relevant to Part-of-Speech (PoS) tagging. The outcome is a flexible tagger…