9842 search results - page 280 / 1969 » The Complexity of the Matching-Cut Problem |
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...
97
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
This article addresses the problem of real-time visual tracking in presence of complex motion blur. Previous authors have observed that efficient tracking can be obtained by match...
152
Voted
STOC
1999
ACM
15 years 5 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
104
Voted
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
We propose a non-iterative solution to the PnP problem--the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences--whose computational complexity gro...
109
Voted
EAGC
2004
Springer
15 years 6 months ago
2004
Springer
AS complexity of computational applications and their environments has been increased due to the heterogeneity of resources; complexity, continuous changes of the applications as w...