7773 search results - page 213 / 1555 » On generalized Frame-Stewart numbers |
202
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
We propose a multi-resolution framework inspired by human visual search for general object detection. Different resolutions are represented using a coarse-to-fine feature hierarch...
202
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
135
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
A system of using a planar parallel plate to achieve single camera stereo has been proposed by Nishimoto and Shirai[5].Their work was based on an assumption that the optical axis ...
182
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
210
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...