7106 search results - page 1157 / 1422 » Restricted Complexity, General Complexity |
180
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
206
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
We present a framework for the automatic recognition of complex multi-agent events in settings where structure is imposed by rules that agents must follow while performing activit...
210
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
Alpha matting refers to the problem of softly extracting the foreground from an image. Given a trimap (specifying known foreground/background and unknown pixels), a straightforwar...
156
click to vote
ACCV
2010
Springer
15 years 1 months ago
2010
Springer
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...
200
click to vote
ACMSE
2010
ACM
15 years 1 months ago
2010
ACM
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...