An upper bound for the domination number of the direct product of graphs is proved. It in particular implies that for any graphs G and H, γ(G × H) ≤ 3γ(G)γ(H). Graphs with a...
The recovery of writing trajectory from offline handwritten image is generally regarded as a difficult problem [1]. This paper introduced a method to recover the writing trajector...
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
We present a system that learns to follow navigational natural language directions. Where traditional models learn from linguistic annotation or word distributions, our approach i...
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...