Sciweavers

ACL
1998
14 years 8 days ago
Restrictions on Tree Adjoining Languages
Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n 6) worst case running time. In this paper we investigate which restrictions on T...
Giorgio Satta, William Schuler
IPPS
2002
IEEE
14 years 3 months ago
An Associative Static and Dynamic Convex Hull Algorithm
This paper presents a new static and dynamic recursive parallel algorithm for the convex hull problem. This algorithm is a parallel adaptation of the Graham Scan and Quick Hull al...
Maher M. Atwah, Johnnie W. Baker
ASPDAC
2004
ACM
120views Hardware» more  ASPDAC 2004»
14 years 4 months ago
Efficient octilinear Steiner tree construction based on spanning graphs
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...
Qi Zhu, Hai Zhou, Tong Jing, Xianlong Hong, Yang Y...