4218 search results - page 450 / 844 » Complete sets of cooperations |
191
click to vote
RTA
1993
Springer
15 years 11 months ago
1993
Springer
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ ...
171
click to vote
STOC
1993
ACM
15 years 11 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
229
click to vote
IFIP
1992
Springer
15 years 11 months ago
1992
Springer
This paper presents a completely systematic design procedure for asynchronous controllers. The initial step is the construction of a signal transition graph (STG, an interpreted P...
181
click to vote
ACSD
2007
IEEE
15 years 11 months ago
2007
IEEE
Synthesis of asynchronous circuits from Signal Transition Graphs (STGs) involves resolution of state encoding conflicts by means of refining the STG specification. In this paper, ...
181
click to vote
CAIP
2007
Springer
15 years 11 months ago
2007
Springer
This paper describes a technique for the representation of the 2D frontal view of faces, based on Catmull-Rom splines. It takes advantage of the a priori knowledge about the face s...