4110 search results - page 37 / 822 » Efficient algorithms for the 2-gathering problem |
156
click to vote
ACL
1990
15 years 7 months ago
1990
In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for natural language description -- analysis as well as generation. In this paper we concentrate on...
175
click to vote
JCSS
2002
15 years 5 months ago
2002
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...
153
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
This paper proposes a framework that provides significant speed-ups and also improves the effectiveness of general message passing algorithms based on dual LP relaxations. It is ap...
158
click to vote
CONPAR
1992
15 years 10 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
173
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...