Sciweavers

709 search results - page 103 / 142
» An Equational Theory for Transactions
Sort
View
ENTCS
2006
113views more  ENTCS 2006»
14 years 11 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
IJON
2008
186views more  IJON 2008»
14 years 11 months ago
Computational analysis and learning for a biologically motivated model of boundary detection
In this work we address the problem of boundary detection by combining ideas and approaches from biological and computational vision. Initially, we propose a simple and efficient ...
Iasonas Kokkinos, Rachid Deriche, Olivier D. Fauge...
JMIV
2008
106views more  JMIV 2008»
14 years 11 months ago
Estimation of Vector Fields in Unconstrained and Inequality Constrained Variational Problems for Segmentation and Registration
Vector fields arise in many problems of computer vision, particularly in non-rigid registration. In this paper, we develop coupled partial differential equations (PDEs) to estimat...
Gozde B. Unal, Greg G. Slabaugh
CVIU
2007
125views more  CVIU 2007»
14 years 11 months ago
Graph regularization for color image processing
Nowadays color image processing is an essential issue in computer vision. Variational formulations provide a framework for color image restoration, smoothing and segmentation prob...
Olivier Lezoray, Abderrahim Elmoataz, Sébas...
LISP
2006
105views more  LISP 2006»
14 years 11 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy