170 search results - page 24 / 34 » Generalised Epipolar Constraints |
CONSTRAINTS
2007
13 years 7 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
JELIA
2004
Springer
14 years 1 months ago
2004
Springer
We present a framework for expressing different merging operators for belief sets. This framework is a generalisation of our earlier work concerning consistency-based belief revisi...
NMR
2004
Springer
14 years 1 months ago
2004
Springer
We present a framework for investigating merging operators for belief sets. This framework is a generalisation of our earlier work concerning consistency-based belief revision and...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Depth-map merging approaches have become more and
more popular in multi-view stereo (MVS) because of their
flexibility and superior performance. The quality of depth
map used fo...