Implicit surface modeling systems have been used since the mid-1980s for the generation of cartoon-like characters. Recently implicit models combined with constructive solid geome...
Callum Galbraith, Przemyslaw Prusinkiewicz, Brian ...
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal
We survey a number of decidablity and undecidablity results concerning epistemic temporal logic. The goal is to provide a general picture which will facilitate the `sharing of idea...
Extracting tree transducer rules for syntactic MT systems can be hindered by word alignment errors that violate syntactic correspondences. We propose a novel model for unsupervise...
— Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a cost effe...
Dirk Gorissen, Luciano De Tommasi, Jeroen Croon, T...