242 search results - page 34 / 49 » A SAT-Based Algorithm for Context Matching |
COLING
2010
13 years 2 months ago
2010
Near-synonyms are useful knowledge resources for many natural language applications such as query expansion for information retrieval (IR) and paraphrasing for text generation. Ho...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
In object tracking, occlusions significantly undermine the performance of tracking algorithms. Unlike the existing methods that solely depend on the observed target appearance to ...
ACCV
2010
Springer
13 years 2 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...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The stable marriage problem is a well-known problem of matching men to women so that no man and woman, who are not married to each other, both prefer each other. Such a problem ha...