We place synchronous tree-adjoining grammars and tree transducers in the single overarching framework of bimorphisms, continuing the unification of synchronous grammars and tree t...
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
In this paper we present a non-interactive method for recoloring a destination image according to the color scheme found in a source image. The approach is motivated by trying to ...
Emerging applications in electronic commerce often involve very low-cost transactions, which execute in the context of ongoing, extended clientserver relationships. For example, c...
Yossi Matias, Alain J. Mayer, Abraham Silberschatz
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...