562 search results - page 38 / 113 » Dependency Pairs Revisited |
82
Voted
ICCS
2005
Springer
15 years 7 months ago
2005
Springer
We revisit and use the dependence transformation method to generate parallel algorithms suitable for cluster and grid computing. We illustrate this method in two applications: to o...
95
Voted
EMNLP
2009
14 years 11 months ago
2009
We present an implicit discourse relation classifier in the Penn Discourse Treebank (PDTB). Our classifier considers the context of the two arguments, word pair information, as we...
125
click to vote
STOC
1992
ACM
15 years 5 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
100
Voted
ISLPED
2007
ACM
15 years 3 months ago
2007
ACM
This paper presents a power reduction mechanism for the write operation in register files (RegFiles), which adds a conditional charge-sharing structure to the pair of complementar...
105
click to vote
LREC
2008
15 years 3 months ago
2008
In this paper, we describe our work on building a parallel treebank for a less studied and typologically dissimilar language pair, namely Swedish and Turkish. The treebank is a ba...