Sciweavers

4 search results - page 1 / 1
» Low Randomness Rumor Spreading via Hashing
Sort
View
STACS
2012
Springer
12 years 3 days ago
Low Randomness Rumor Spreading via Hashing
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...
INFOCOM
2009
IEEE
13 years 11 months ago
Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
Elias Kehdi, Baochun Li
BMCBI
2005
136views more  BMCBI 2005»
13 years 4 months ago
Automatic detection of false annotations via binary property clustering
Background: Computational protein annotation methods occasionally introduce errors. Falsepositive (FP) errors are annotations that are mistakenly associated with a protein. Such f...
Noam Kaplan, Michal Linial
ANSS
2007
IEEE
13 years 11 months ago
Scalable Data Collection Protocols for Wireless Sensor Networks with Multiple Mobile Sinks
Data propagation in wireless sensor networks is usually performed as a multihop process. To deliver a single message, the resources of many sensor nodes are used and a lot of ener...
Athanasios Kinalis, Sotiris E. Nikoletseas