1242 search results - page 218 / 249 » A Computational Complexity Theory in Membrane Computing |
WOLLIC
2009
Springer
14 years 1 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
CIKM
2009
Springer
14 years 1 months ago
2009
Springer
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
SIGIR
2009
ACM
14 years 1 months ago
2009
ACM
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
CMSB
2007
Springer
14 years 1 months ago
2007
Springer
We explore some presynaptic mechanisms of the calyx of Held synapse through a stochastic model. The model, drawn from a kinetic approach developed in literature, exploits process c...