Studying large deformations with a Riemannian approach has been an efficient point of view to generate metrics between deformable objects, and to provide accurate, non ambiguous an...
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
Background: Computing exact multipoint LOD scores for extended pedigrees rapidly becomes infeasible as the number of markers and untyped individuals increase. When markers are exc...
Cornelis A. Albers, Martijn A. R. Leisink, Hilbert...
We propose an efficient solution to the general M-view projective reconstruction problem, using matrix factorization and iterative least squares. The method can accept input with ...