235 search results - page 37 / 47 » An efficient consistency algorithm for the Temporal Constrai... |
120
Voted
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
Correspondence problems are of great importance in
computer vision. They appear as subtasks in many applications
such as object recognition, merging partial 3D reconstructions
a...
109
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...
158
Voted
CAV
2004
Springer
15 years 7 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
115
Voted
SWAT
1998
Springer
15 years 7 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
157
click to vote
EMSOFT
2004
Springer
15 years 9 months ago
2004
Springer
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...