209 search results - page 29 / 42 » The Computational Complexity of Weak Saddles |
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. Movies and TV are a rich source of diverse and complex video of people, objects, actions and locales "in the wild". Harvesting automatically labeled sequences o...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
ICIAP
2005
ACM
14 years 7 months ago
2005
ACM
This paper introduces a new efficient way for computing affine invariant features from gray-scale images. The method is based on a novel image transform which produces infinitely m...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
SARA
2007
Springer
14 years 1 months ago
2007
Springer
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...