Semantic Scholar uses AI to extract papers important to this topic.
In this thesis we develop a discriminative learning method for dependency parsing using online large-margin training combined… Expand This paper proves that the scaling limit of a loop-erased random walk in a simply connected domain \(D\mathop \subset \limits_… Expand The paper considers the problem of covering a continuous planar area by a square-shaped tool attached to a mobile robot. Using a… Expand AbstractThe uniform spanning tree (UST) and the loop-erased random walk (LERW) are strongly related probabilistic processes. We… Expand Consider the nearest neighbor graph for the integer lattice Zd in d dimensions. For a large finite piece of it, consider choosing… Expand A random walk on a finite graph can be used to construct a uniform random spanning tree. It is shown how random walk techniques… Expand The author describes a probabilistic algorithm that, given a connected, undirected graph G with n vertices, produces a spanning… Expand A NEW combinatorial formulation of the Jones polynomial of a link is used to establish some basic properties of this polynomial… Expand We consider the problem of routing vehicles stationed at a central facility (depot) to supply customers with known demands, in… Expand Cooperative game theory solution concepts are used to allocate costs in a spanning tree network. Stable cost allocations are… Expand