Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2006

Highly Cited

2006

In this thesis we develop a discriminative learning method for dependency parsing using online large-margin training combined… Expand

Highly Cited

2001

Highly Cited

2001

This paper proves that the scaling limit of a loop-erased random walk in a simply connected domain \(D\mathop \subset \limits_… Expand

Highly Cited

2001

Highly Cited

2001

The paper considers the problem of covering a continuous planar area by a square-shaped tool attached to a mobile robot. Using a… Expand

Highly Cited

1999

Highly Cited

1999

AbstractThe uniform spanning tree (UST) and the loop-erased random walk (LERW) are strongly related probabilistic processes. We… Expand

Highly Cited

1991

Highly Cited

1991

Consider the nearest neighbor graph for the integer lattice Zd in d dimensions. For a large finite piece of it, consider choosing… Expand

Highly Cited

1990

Highly Cited

1990

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

Highly Cited

1989

Highly Cited

1989

The author describes a probabilistic algorithm that, given a connected, undirected graph G with n vertices, produces a spanning… Expand

Highly Cited

1987

Highly Cited

1987

A NEW combinatorial formulation of the Jones polynomial of a link is used to establish some basic properties of this polynomial… Expand

Highly Cited

1981

Highly Cited

1981

We consider the problem of routing vehicles stationed at a central facility (depot) to supply customers with known demands, in… Expand

Highly Cited

1976

Highly Cited

1976

Cooperative game theory solution concepts are used to allocate costs in a spanning tree network. Stable cost allocations are… Expand