case running time | Sciweavers

34

ACL
1998

135views Computational Linguistics» more ACL 1998»

Restrictions on Tree Adjoining Languages

14 years 24 days ago

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

claim paper

Read More »

31

click to vote

IPPS
2002
IEEE

138views Distributed And Parallel Com...» more IPPS 2002»

An Associative Static and Dynamic Convex Hull Algorithm

14 years 4 months ago

Download www.cs.kent.edu

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

claim paper

Read More »

35

click to vote

ASPDAC
2004
ACM

120views Hardware» more ASPDAC 2004»

Efficient octilinear Steiner tree construction based on spanning graphs

14 years 4 months ago

Download www.ee.ucla.edu

--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...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers