14518 search results - page 47 / 2904 » Two Problems for Sophistication |
144
click to vote
WADS
2005
Springer
15 years 8 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
125
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
133
click to vote
SSIAI
2002
IEEE
15 years 8 months ago
2002
IEEE
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
114
click to vote
IPL
2002
15 years 3 months ago
2002
We study the problem of scheduling unit time tasks of two types on m parallel identical machines. For each type, given numbers of tasks are required to be completed by the specifi...
111
Voted
NAACL
2010
15 years 1 months ago
2010
We describe a synchronous parsing algorithm that is based on two successive monolingual parses of an input sentence pair. Although the worst-case complexity of this algorithm is a...