1421 search results - page 148 / 285 » Satisfying KBO Constraints |
180
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...
195
click to vote
DAC
2001
ACM
16 years 8 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
176
Voted
CVPR
1999
IEEE
16 years 9 months ago
1999
IEEE
This paper introduces an extension of Hartley's selfcalibration technique [8] based on properties of the essential matrix, allowing for the stable computation of varying foca...
213
Voted
CVPR
2005
IEEE
16 years 9 months ago
2005
IEEE
This paper addresses the novel problem of automatically synthesizing an output image from a large collection of different input images. The synthesized image, called a digital tap...
206
click to vote
CVPR
2006
IEEE
16 years 9 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...