373 search results - page 39 / 75 » Counting in Trees for Free |
JCT
2011
13 years 3 months ago
2011
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
ICASSP
2011
IEEE
13 years 11 days ago
2011
IEEE
In this paper, we investigate the opportunities offered by floatingpoint arithmetics in enabling an assembly and intrinsics free highlevel language based development. We compare ...
ACL
1990
13 years 9 months ago
1990
according to this definition2. Each elementary tree is constrained to have at least one terminal at its frontier which serves as 'head' (or 'anchor'). Sentence...
ACL
1990
13 years 9 months ago
1990
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— In this paper, we develop and analyze a lowcomplexity cooperative protocol that significantly increases the average throughput of multi-hop upstream transmissions for ...