Sciweavers

6978 search results - page 3 / 1396
» On Proofs in System P
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
Limiting Sybil Attacks in Structured P2P Networks
— One practical limitation of structured peer-to-peer (P2P) networks is that they are frequently subject to Sybil attacks: malicious parties can compromise the network by generat...
Hosam Rowaihy, William Enck, Patrick McDaniel, Tom...
WWW
2008
ACM
14 years 8 months ago
Efficient multi-keyword search over p2p web
Current search mechanisms of DHT-based P2P systems can well handle a single keyword search problem. Other than single keyword search, multi-keyword search is quite popular and use...
Hanhua Chen, Hai Jin, Jiliang Wang, Lei Chen 0002,...
NC
2008
126views Neural Networks» more  NC 2008»
13 years 7 months ago
Spiking neural P systems with extended rules: universality and languages
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems...
Haiming Chen, Mihai Ionescu, Tseren-Onolt Ishdorj,...
IJFCS
2011
78views more  IJFCS 2011»
13 years 2 months ago
P Systems and Topology: Some Suggestions for Research
some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to pology. In turn, the ...
Pierluigi Frisco, Hendrik Jan Hoogeboom
COCO
2007
Springer
109views Algorithms» more  COCO 2007»
14 years 1 months ago
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
Richard Cleve, William Slofstra, Falk Unger, Sarva...