409 search results - page 11 / 82 » Matching Scenarios with Timing Constraints |
IVC
2007
13 years 7 months ago
2007
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
ICTAC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
HIPC
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
IJCV
2006
13 years 7 months ago
2006
This paper studies the problem of matching two unsynchronized video sequences of the same dynamic scene, recorded by different stationary uncalibrated video cameras. The matching i...