We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
embership problem for non-linear Abstract Categorial Grammars Sylvain Salvati Abstract In this paper we show that the membership problem for second order nonbstract Categorial Gram...
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Multiagent reinforcement learning problems are especially difficult because of their dynamism and the size of joint state space. In this paper a new benchmark problem is proposed, ...
ct Although always present in text, word sense ambiguity only recently became regarded as a problem to information retrieval which was potentially solvable. The growth of interest ...