2333 search results - page 97 / 467 » Recursive Computational Depth |
BIRTHDAY
2005
Springer
14 years 2 months ago
2005
Springer
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Ano...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
Localizing objects in images is a difficult task and represents the first step to the solution of the object recognition problem. This paper presents a novel approach to the local...
CONCUR
2005
Springer
14 years 2 months ago
2005
Springer
Many decidability results are known for non-recursive cryptographic protocols, where the protocol steps can be expressed by simple rewriting rules. Recently, a tree transducer-base...
LICS
2006
IEEE
14 years 3 months ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
IWANN
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper presents a comparison between direct and recursive prediction strategies. In order to perform the input selection, an approach based on mutual information is u...