1686 search results - page 45 / 338 » Programs as polygraphs: computability and complexity |
112
click to vote
FOSSACS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—Computing maximum-likelihood bounds on the performance of systems involving partial response (PR) channels, with or without an error correcting code present, is rather c...
ECAL
1995
Springer
15 years 1 months ago
1995
Springer
We present a new self-reproducing cellular automaton capable of construction and computation beyond self-reproduction. Our automaton makes use of some of the concepts developed by...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
ICIP
2008
IEEE
15 years 11 months ago
2008
IEEE
The allowable computational complexity of video encoding is limited in a power-constrained system. Different video frames are associated with different motions and contexts, and s...