1998 search results - page 43 / 400 » Complexity of the Cover Polynomial |
TCS
2008
13 years 9 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
We propose a novel consistent max-covering scheme for
human pose estimation. Consistent max-covering formulates
pose estimation as the covering of body part polygons
on an objec...
ICCTA
2007
IEEE
14 years 4 months ago
2007
IEEE
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
CIAC
2006
Springer
14 years 1 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
JMLR
2002
13 years 9 months ago
2002
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...