Sciweavers

13214 search results - page 2643 / 2643
» Pseudorandomness for network algorithms
Sort
View
27
Voted
SOSP
2007
ACM
14 years 4 months ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
FCT
2009
Springer
14 years 2 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
ASIAN
2005
Springer
178views Algorithms» more  ASIAN 2005»
14 years 27 days ago
An Approach for Service Discovery Based on Semantic Peer-to-Peer
The service discovery is a key step during Peer-to-Peer (P2P) converging with Web Service. In this paper, a semantic-P2P based approach is presented for web service discovery. To e...
Hao Wu, Hai Jin, Yunfa Li, Hanhan Chen
BMCBI
2007
127views more  BMCBI 2007»
13 years 7 months ago
Characterization and simulation of cDNA microarray spots using a novel mathematical model
Background: The quality of cDNA microarray data is crucial for expanding its application to other research areas, such as the study of gene regulatory networks. Despite the fact t...
Hye Young Kim, Seo Eun Lee, Min Jung Kim, Jin Il H...
« Prev « First page 2643 / 2643 Last » Next »