6437 search results - page 526 / 1288 » Parallel Algorithms for Arrangements |
149
click to vote
ACL
2006
15 years 7 months ago
2006
In this paper, we will present an efficient method to compute the co-occurrence counts of any pair of substring in a parallel corpus, and an algorithm that make use of these count...
157
click to vote
COLING
2002
15 years 6 months ago
2002
The paper presents a statistical approach to automatic building of translation lexicons from parallel corpora. We briefly describe the pre-processing steps, a baseline iterative m...
258
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...
282
Voted
ICDCN
2011
Springer
14 years 9 months ago
2011
Springer
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
142
click to vote
ICASSP
2008
IEEE
16 years 22 days ago
2008
IEEE
A new technique to acquire pseudo-noise (PN) sequences has been recently proposed in [1] and [2]. It is based on the paradigm of iterative Message Passing (iMP) to be run on loopy...