Sciweavers

1205 search results - page 14 / 241
» On P Systems with Bounded Parallelism
Sort
View
CCGRID
2006
IEEE
13 years 11 months ago
Density-Based Clustering for Similarity Search in a P2P Network
P2P systems represent a large portion of the Internet traffic which makes the data discovery of great importance to the user and the broad Internet community. Hence, the power of ...
Mouna Kacimi, Kokou Yétongnon
SPAA
2003
ACM
14 years 22 days ago
Relaxing the problem-size bound for out-of-core columnsort
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
Geeta Chaudhry, Elizabeth A. Hamon, Thomas H. Corm...
CCGRID
2009
IEEE
14 years 2 months ago
Self-Chord: A Bio-inspired Algorithm for Structured P2P Systems
This paper presents “Self-Chord”, a bio-inspired P2P algorithm that can be profitably adopted to build the information service of distributed systems, in particular Computati...
Agostino Forestiero, Carlo Mastroianni, Michela Me...
DASFAA
2003
IEEE
139views Database» more  DASFAA 2003»
14 years 24 days ago
Securing Your Data in Agent-Based P2P Systems
Peer-to-peer (P2P) technology can be naturally integrated with mobile agent technology in Internet applications, taking advantage of the autonomy, mobility, and efficiency of mobi...
Xiaolin Pang, Barbara Catania, Kian-Lee Tan
ICPADS
2006
IEEE
14 years 1 months ago
OBN: Peering for Finding Suppliers in P2P On-demand Streaming Systems
A critical issue in peer-to-peer (P2P) streaming systems is to find a peer that can provide required streaming data (eligibility determination) with good quality (quality optimiza...
Chi-Shiang Liao, Wen-Hung Sun, Chung-Ta King, Hung...