6542 search results - page 263 / 1309 » The tao of parallelism in algorithms |
194
click to vote
EMNLP
2010
15 years 4 months ago
2010
We show that jointly performing semantic role labeling (SRL) on bitext can improve SRL results on both sides. In our approach, we use monolingual SRL systems to produce argument c...
210
click to vote
PR
2011
14 years 9 months ago
2011
This paper aims to address the problem of anomaly detection and discrimination in complex behaviours, where anomalies are subtle and difficult to detect owing to the complex tempo...
178
click to vote
PDP
2003
IEEE
16 years 5 hour ago
2003
IEEE
The paper presents a Coarse-Grained Multicomputer algorithm that solves the Longest Common Subsequence Problem. This algorithm can be implemented in the CGM with È processors in ...
176
click to vote
ISAAC
1997
Springer
15 years 11 months ago
1997
Springer
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
166
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...