1205 search results - page 79 / 241 » On P Systems with Bounded Parallelism |
MOC
1998
13 years 7 months ago
1998
Consider the system of Diophantine equations x2 − ay2 = b, P (x, y) = z2, where P is a given integer polynomial. Historically, such systems have been analyzed by using Baker’s ...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
For a Peer-to-Peer (P2P) system which contains huge amount of data, an efficient content search technique is definitely necessary. In this paper, we present a novel category overl...
ASAP
2006
IEEE
13 years 9 months ago
2006
IEEE
This paper proposes a novel parallel approach for pipelining of nested multiplexer loops to design high speed decision feedback equalizers (DFEs) based on look-ahead techniques. I...
PPL
2006
13 years 7 months ago
2006
In the model of restricted parallel links, n users must be routed on m parallel links under the restriction that the link for each user be chosen from a certain set of allowed lin...
STOC
1995
ACM
13 years 11 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...