Sciweavers

605 search results - page 28 / 121
» Normalizers and Split Extensions
Sort
View
81
Voted
NJC
2006
86views more  NJC 2006»
14 years 11 months ago
Axiomatizing Binding Bigraphs
We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove tha...
Troels Christoffer Damgaard, Lars Birkedal
91
Voted
CSL
1999
Springer
14 years 10 months ago
The Bell Labs German text-to-speech system
In this paper we present an overview of the German version of the Bell Labs text-to-speech system, a high-quality concatenative synthesis system with extensive text analysis capab...
Bernd Möbius
120
Voted
3DOR
2008
15 years 2 days ago
A 3D Face Recognition Algorithm Using Histogram-based Features
We present an automatic face recognition approach, which relies on the analysis of the three-dimensional facial surface. The proposed approach consists of two basic steps, namely ...
Xuebing Zhou, Helmut Seibert, Christoph Busch, Wol...
107
Voted
ASP
2005
Springer
15 years 4 months ago
Possibilistic Stable Model Computing
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
Pascal Nicolas, Claire Lefèvre
121
Voted
MCMASTER
1993
15 years 3 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz