Sciweavers

ALGORITHMICA
2002
109views more  ALGORITHMICA 2002»
13 years 4 months ago
A Near-Linear Area Bound for Drawing Binary Trees
We present several simple methods to construct planar, strictly upward, strongly order-preserving, straight-line drawings of any n-node binary tree. In particular, it is shown that...
Timothy M. Chan
ACL
2004
13 years 6 months ago
Improving IBM Word Alignment Model 1
We investigate a number of simple methods for improving the word-alignment accuracy of IBM
Robert C. Moore