3378 search results - page 255 / 676 » A universe of binding and computation |
222
click to vote
SIAMDM
2010
15 years 5 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
157
Voted
ICCV
1998
IEEE
16 years 8 months ago
1998
IEEE
A framework for modeling and recognition of temporal activities is proposed. The modeling of sets of exemplar activities is achieved by parameterizing their representation in the ...
159
Voted
MEMBRANE
2004
Springer
16 years 1 days ago
2004
Springer
We introduce in the P systems area a mechanism, inspired from neural-cell behavior, which controls computations by inhibiting and de-inhibiting evolution rules. We investigate the ...
148
click to vote
INTERACT
2003
15 years 8 months ago
2003
: Human-Computer Interaction field in Spain has experienced a great expansion in the last few years, even if this happened with some delay in comparison with neighbour countries. T...
178
click to vote
IPL
2006
15 years 6 months ago
2006
In this paper we investigate P systems whose compartments contain sets of symbolobjects rather than multisets of objects, as it is common in membrane computing. If the number of m...