140 search results - page 14 / 28 » Computing the Edit-Distance between Unrooted Ordered Trees |
APSEC
2001
IEEE
14 years 8 days ago
2001
IEEE
Word processing software, email, and spreadsheet have revolutionized office activities. There are many other office tasks that are amenable to automation, such as: scheduling a vi...
ISPDC
2006
IEEE
14 years 2 months ago
2006
IEEE
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
ACL
2012
11 years 11 months ago
2012
Long distance word reordering is a major challenge in statistical machine translation research. Previous work has shown using source syntactic trees is an effective way to tackle ...
CG
2004
Springer
14 years 2 months ago
2004
Springer
In this paper a new method is described for move ordering, called the relative history heuristic. It is a combination of the history heuristic and the butterfly heuristic. Instead...
ISAAC
1998
Springer
14 years 25 days ago
1998
Springer
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...