10 search results - page 2 / 2 » A Case Study on Proving Transformations Correct: Data-Parall... |
AGP
1997
IEEE
13 years 9 months ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
MKM
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We present a computational origami construction of Morley’s triangles and automated proof of correctness of the generalized Morley’s theorem in a streamlined process ...
ACII
2007
Springer
13 years 11 months ago
2007
Springer
In this paper, we address the tasks of recognition and interpretation of affect communicated through text messaging. The evolving nature of language in online conversations is a ma...
GG
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
CRYPTO
2005
Springer
13 years 11 months ago
2005
Springer
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...