Sciweavers

1612 search results - page 208 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
AP2PC
2004
Springer
15 years 10 months ago
Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance
Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust sel...
George H. L. Fletcher, Hardik A. Sheth, Katy B&oum...
CSB
2003
IEEE
15 years 10 months ago
Fast and Sensitive Probe Selection for DNA Chips Using Jumps in Matching Statistics
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
Sven Rahmann
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
16 years 5 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai
MOBIHOC
2006
ACM
16 years 4 months ago
Data storage placement in sensor networks
Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces stora...
Bo Sheng, Qun Li, Weizhen Mao
CCGRID
2007
IEEE
15 years 11 months ago
Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research
While a grid represents a computing infrastructure for cross domain sharing of computational resources, the cyberinfrastructure, proposed by the US NSF Blue – Ribbon advisory pa...
Jie Yin, Junwei Cao, Yuexuan Wang, Lianchen Liu, C...