Shadow computation in dynamic scenes under complex illumination is a challenging problem. Methods based on precomputation provide accurate, real-time solutions, but are hard to ex...
Thomas Annen, Zhao Dong, Tom Mertens, Philippe Bek...
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
In this paper, we present an integration framework for heterogeneous motion generators. The objective is to outline issues that are currently easily solved in professional post-pr...
Luc Emering, Ronan Boulic, Tom Molet, Daniel Thalm...
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
Both Robots and Personal Computers established new markets about 30 years ago and were enabling factors in Automation and Information Technology. However, while you can see Person...
Martin Wojtczyk, Michael Marszalek, Alois Knoll, R...