396 search results - page 63 / 80 » Exact Algorithms for Graph Homomorphisms |
109
Voted
ECCV
2006
Springer
16 years 3 months ago
2006
Springer
Visibility estimation is arguably the most difficult problem in dense 3D reconstruction from multiple arbitrary views. In this paper, we propose a simple new approach to estimating...
110
Voted
ICIP
2008
IEEE
16 years 3 months ago
2008
IEEE
This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system. The spatial interpolation process often fa...
ISMVL
2006
IEEE
15 years 8 months ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
124
click to vote
CASES
2004
ACM
15 years 5 months ago
2004
ACM
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
116
click to vote
CCCG
2009
15 years 3 months ago
2009
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...