Sciweavers

564 search results - page 6 / 113
» Corner cutting systems
Sort
View
CSL
2003
Springer
14 years 27 days ago
Atomic Cut Elimination for classical Logic
System SKS is a set of rules for classical propositional logic presented in the calculus of structures. Like sequent systems and unlike natural deduction systems, it has an explici...
Kai Brünnler
IGPL
2007
107views more  IGPL 2007»
13 years 7 months ago
Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs
This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only bra...
Marcelo Finger, Dov M. Gabbay
DATE
2007
IEEE
81views Hardware» more  DATE 2007»
14 years 2 months ago
Improving utilization of reconfigurable resources using two dimensional compaction
Partial reconfiguration allows parts of the reconfigurable chip area to be configured without affecting the rest of the chip. This allows placement of tasks at run time on the rec...
Ahmed A. El Farag, Hatem M. El-Boghdadi, Samir I. ...
EMMCVPR
2011
Springer
12 years 7 months ago
SlimCuts: GraphCuts for High Resolution Images Using Graph Reduction
Abstract. This paper proposes an algorithm for image segmentation using GraphCuts which can be used to efficiently solve labeling problems on high resolution images or resource-lim...
Björn Scheuermann, Bodo Rosenhahn
TLCA
2005
Springer
14 years 1 months ago
Semantic Cut Elimination in the Intuitionistic Sequent Calculus
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
Olivier Hermant