366 search results - page 11 / 74 » Model-checking higher-order functions |
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...
FSS
2011
14 years 3 months ago
2011
In many practical applications, it is useful to represent a function f(x) by its fuzzy transform, i.e., by the “average” values Fi = f(x) · Ai(x) dx Ai(x) dx over different ...
LICS
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...
101
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
A number of 3D shape reconstruction algorithms, in particular 3D image segmentation methods, produce their results in the form of binary volumes, where a binary value indicates whe...
105
click to vote
IEICET
2007
14 years 11 months ago
2007
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...