578 search results - page 107 / 116 » The Minimum-Entropy Set Cover Problem |
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
In this paper we address the problem of aligning 3-D data with articulated shapes. This problem resides at the core of many motion tracking methods with applications in human motio...
UC
2009
Springer
14 years 2 months ago
2009
Springer
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
FOCS
2002
IEEE
14 years 14 days ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
COMPGEOM
1994
ACM
13 years 11 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
SPAA
2010
ACM
13 years 7 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...