1242 search results - page 54 / 249 » A Computational Complexity Theory in Membrane Computing |
119
click to vote
RTA
2005
Springer
15 years 3 months ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we...
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we present a mathematical theory for Marr's primal sketch. We first conduct a theoretical study of the descriptive Markov random field model and the generative...
CORR
2000
Springer
14 years 9 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...