Sciweavers

896 search results - page 43 / 180
» On completeness of word reversing
Sort
View
CALCO
2005
Springer
85views Mathematics» more  CALCO 2005»
15 years 6 months ago
Using Proofs by Coinduction to Find "Traditional" Proofs
In the specific situation of formal reasoning concerned with “regular expression equivalence” we address instances of more general questions such as: how can coinductive argum...
Clemens Grabmayer
93
Voted
MICRO
2002
IEEE
97views Hardware» more  MICRO 2002»
15 years 5 months ago
Three extensions to register integration
Register integration (or just integration) is a register renaming discipline that implements instruction reuse via physical register sharing. Initially developed to perform squash...
Vlad Petric, Anne Bracy, Amir Roth
82
Voted
AFRIGRAPH
2006
ACM
15 years 6 months ago
Free-form modelling for surface inpainting
In this paper, we describe a novel approach to 3D shape modelling, targeting at the reconstruction and repair of digitised models – a task that is frequently encountered in part...
Gerhard H. Bendels, Michael Guthe, Reinhard Klein
JAR
2007
77views more  JAR 2007»
15 years 18 days ago
Superposition-based Equality Handling for Analytic Tableaux
We present a variant of the basic ordered superposition rules to handle equality in an analytic free-variable tableau calculus. We prove completeness of this calculus by an adaptat...
Martin Giese
STACS
1992
Springer
15 years 4 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...