Search Sciweavers | Sciweavers

21

ICIP
2006
IEEE

154views Image Processing» more ICIP 2006»

Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation

14 years 9 months ago

We apply the dead-end elimination (DEE) strategy from protein design as a heuristic for the max-flow/min-cut formulation of the image segmentation problem. DEE combines aspects of...

Mala L. Radhakrishnan, Sara L. Su

claim paper

Read More »

26

click to vote

CADE
2006
Springer

127views Logical Reasoning» more CADE 2006»

Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic

14 years 7 months ago

Download www.cs.st-andrews.ac.uk

Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...

Roy Dyckhoff, Delia Kesner, Stéphane Lengra...

claim paper

Read More »

23

click to vote

WOLLIC
2009
Springer

144views Artificial Intelligence» more WOLLIC 2009»

Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus

14 years 2 months ago

Download ropas.snu.ac.kr

We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantiﬁcation. We use a cut-fr...

Hugo Herbelin, Gyesik Lee

claim paper

Read More »

25

click to vote

ICTCS
2003
Springer

119views Theoretical Computer Science» more ICTCS 2003»

On the Computational Complexity of Cut-Elimination in Linear Logic

14 years 20 days ago

Download www.cs.brandeis.edu

Abstract. Given two proofs in a logical system with a conﬂuent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...

Harry G. Mairson, Kazushige Terui

claim paper

Read More »

21

click to vote

TLCA
2009
Springer

135views Theoretical Computer Science» more TLCA 2009»

The Cut-Elimination Theorem for Differential Nets with Promotion

14 years 8 min ago