Sciweavers

98 search results - page 15 / 20
» Simplifying reductions
Sort
View
IJSI
2008
109views more  IJSI 2008»
13 years 7 months ago
Modular Church-Rosser Modulo: The Complete Picture
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
Jean-Pierre Jouannaud, Yoshihito Toyama
JLP
2008
134views more  JLP 2008»
13 years 7 months ago
Backwards type analysis of asynchronous method calls
Asynchronous method calls have been proposed to better integrate object orientation with distribution. In the Creol language, asynchronous method calls are combined with so-called...
Einar Broch Johnsen, Ingrid Chieh Yu
JSC
2006
71views more  JSC 2006»
13 years 7 months ago
Towards a clausal analysis of cut-elimination
In this paper we show that a large class of cut-elimination methods can be analyzed by clause terms representing sets of characteristic clauses extractable from the original proof...
Matthias Baaz, Alexander Leitsch
TCAD
2008
102views more  TCAD 2008»
13 years 7 months ago
Quantum Circuit Simplification and Level Compaction
Abstract--Quantum circuits are time-dependent diagrams describing the process of quantum computation. Usually, a quantum algorithm must be mapped into a quantum circuit. Optimal sy...
Dmitri Maslov, Gerhard W. Dueck, D. Michael Miller...
TKDE
2008
121views more  TKDE 2008»
13 years 7 months ago
Kernel Uncorrelated and Regularized Discriminant Analysis: A Theoretical and Computational Study
Linear and kernel discriminant analyses are popular approaches for supervised dimensionality reduction. Uncorrelated and regularized discriminant analyses have been proposed to ove...
Shuiwang Ji, Jieping Ye