1972 search results - page 156 / 395 » connection 2008 |
180
click to vote
UAI
2003
15 years 7 months ago
2003
We propose a framework to extend Markov random walks (Szummer and Jaakkola, 2001) to a continuum of points. In this framework, the transition probability between two points is the...
131
Voted
COLING
2000
15 years 7 months ago
2000
A method is de.scribed by which a rhetoricalstructure tree can be realized by a text structure made up of sections, paragraphs, sentences, vertical lists, mid other textual patter...
160
Voted
VMV
2000
15 years 7 months ago
2000
The use of polygonal meshes, especially triangle meshes, is manifold but a lot of algorithms require the mesh to be structured in a certain way and cannot be applied to an arbitra...
146
click to vote
COLING
1996
15 years 7 months ago
1996
The experiments described here have been done in connection with the LS-GRAM project, which is concerned with the development of large scale grammars and thus foreseen the coverag...
158
click to vote
COLING
1994
15 years 7 months ago
1994
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...