2496 search results - page 384 / 500 » On covering by translates of a set |
218
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
157
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
We localize and strengthen Katona’s idea of an edge-toughness to a local topological toughness. We disprove a conjecture of Katona concerning the connection between edgetoughnes...
185
click to vote
CVPR
1997
IEEE
16 years 8 months ago
1997
IEEE
This paper describes an efficient approach to pose invariant object recognition employing pictorial recognition of image patches. A complete affine invariance is achieved by a rep...
131
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
To implement a persistent tracker, we build a set of viewdependent object appearance models adaptively and automatically while tracking an object under different viewing angles. T...
190
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper, we propose a novel method of computing the optical flow using the Fourier Mellin Transform (FMT). Each image in a sequence is divided into a regular grid of patches...