680 search results - page 109 / 136 » Complexity of Strict Implication |
PLANX
2008
13 years 9 months ago
2008
Macro forest transducers (mfts) extend macro tree transducers (mtts) from ranked to unranked trees. Mfts are more powerful than mtts (operating on binary tree encodings) because t...
ECCC
2006
13 years 7 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
TMI
2008
13 years 7 months ago
2008
Diffusion spectrum imaging (DSI) can map complex fiber microstructures in tissues by characterizing their 3-D water diffusion spectra. However, a long acquisition time is required ...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
In recent work we have presented a formal framework for linguistic annotation based on labeled acyclic digraphs. These `annotation graphs' oer a simple yet powerful method fo...
INFORMATICALT
2010
13 years 6 months ago
2010
Abstract. As a means of supporting quality of service guarantees, aggregate multiplexing has attracted a lot of attention in the networking community, since it requires less comple...