1160 search results - page 3 / 232 » Revisiting the Sequence Constraint |
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. In this paper we introduce a principled approach to modeling the image brightness constraint for optical flow algorithms. Using a simple noise model, we derive a probabil...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
AMW
2010
13 years 8 months ago
2010
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination in RDF in the presence of rules (in the form of Datalog rules) a...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Indisputably Normalized Cuts is one of the most popular segmentation algorithms in computer vision. It has been applied to a wide range of segmentation tasks with great success. A...
CPAIOR
2010
Springer
13 years 12 months ago
2010
Springer
