919 search results - page 45 / 184 » Efficient computation of view subsets |
JMIV
2006
13 years 8 months ago
2006
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...
AIPS
2006
13 years 10 months ago
2006
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 ...
JAIR
2008
13 years 8 months ago
2008
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...
BMCBI
2006
13 years 8 months ago
2006
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...
CVPR
1999
IEEE
14 years 1 months ago
1999
IEEE
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 ...