688 search results - page 80 / 138 » Types for trees |
104
click to vote
SIAMSC
2011
14 years 2 months ago
2011
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...
104
click to vote
EJC
2002
14 years 11 months ago
2002
A subgraph H of a graph G is gated if for every x V(G) there exists a vertex u in H such that dG (x, v) = dG (x, u) + d G (u, v) for any v V(H). The gated amalgam of graphs G 1 an...
EMNLP
2007
15 years 1 months ago
2007
We present experiments with a dependency parsing model defined on rich factors. Our model represents dependency trees with factors that include three types of relations between t...
ACL
1998
15 years 1 months ago
1998
This paper describes a system that performs hierarchical error repair for illformed sentences, with heterarchical control of chart items produced at the lexical, syntactic, and se...
FLOPS
2010
Springer
14 years 10 months ago
2010
Springer
We present a flexible skeleton for implementing distributed work pools in our parallel functional language Eden. The skeleton manages a pool of tasks (work pool) in a distributed ...