331 search results - page 13 / 67 » HOLCF: Higher Order Logic of Computable Functions |
CVPR
2010
IEEE
15 years 6 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...
CVPR
2008
IEEE
15 years 11 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 ...
POPL
2010
ACM
15 years 6 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
IEICET
2007
14 years 9 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...
ICIP
2001
IEEE
15 years 11 months ago
2001
IEEE
The use of higher-order local autocorrelations as features for pattern recognition has been acknowledged since many years, but their applicability was restricted to relatively low...