148 search results - page 6 / 30 » On the extender algebra being complete |
FSS
2006
13 years 7 months ago
2006
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...
UIST
2006
ACM
14 years 1 months ago
2006
ACM
We present the design and implementation of a word-level stroking system called Fisch, which is intended to improve the speed of character-level unistrokes. Importantly, Fisch doe...
COMCOM
1999
13 years 7 months ago
1999
We present a problem of commonly used characterization sequences (CS) for the protocol conformance testing and propose a new test sequence to resolve the problem. The proposed tes...
ALGORITHMS
2010
13 years 5 months ago
2010
Increasingly encompassing models have been suggested for our world. Theories range from generally accepted to increasingly speculative to apparently bogus. The progression of theo...
CALCO
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We extend the theory of (co-)spans as a means of providing an algebraic approach to complex interactions as they arise in software-intensive systems. In order to make int...