777 search results - page 112 / 156 » The Refined Process Structure Tree |
130
click to vote
IDEAL
2005
Springer
15 years 9 months ago
2005
Springer
Recently, there has been a considerable research activity in extending topographic maps of vectorial data to more general data structures, such as sequences or trees. However, the ...
136
Voted
ADBIS
1995
Springer
15 years 7 months ago
1995
Springer
One of the most important operations in spatial access needed systems are spatial joins. Using for processing such operations R-tree like structures is intensively studies now. Th...
118
Voted
EACL
2006
ACL Anthology
15 years 5 months ago
2006
ACL Anthology
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
121
Voted
TOG
2008
15 years 3 months ago
2008
We propose a data-driven approach to automatically generate a scene where tens to hundreds of characters densely interact with each other. During off-line processing, the close in...
150
Voted
EMNLP
2010
15 years 1 months ago
2010
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...