Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

30

PODC
2010
ACM

favoriteEmaildiscussreport

149views Distributed and Parallel Com...» more PODC 2010»

Partial information spreading with application to distributed maximum coverage

14 years 2 months ago

Partial information spreading with application to distributed maximum coverage

Download www.cs.technion.ac.il

This paper addresses partial information spreading among n nodes of a network. As opposed to traditional information spreading, where each node has a message that must be received by all nodes, we propose a relaxed requirement, where only n/c nodes need to receive each message, and every node

Keren Censor Hillel, Hadas Shachnai

Real-time Traffic

Distributed And Parallel Computing | N/c Nodes | Partial Information | PODC 2010 | Relaxed Requirement |

claim paper

Related Content

» Heterogenous dating service with application to rumor spreading

» Lifetime and coverage guarantees through distributed coordinatefree sensor activation

» Improving text collection selection with coverage and overlap statistics

» Incorporating Priors on Expert Performance Parameters for Segmentation Validation and Labe...

» Diagnosing mobile applications in the wild

» Analysis on the redundancy of wireless sensor networks

» Handling sporadic tasks in offline scheduled distributed realtime systems

» Depth Detection of Light Field

» Selectivity Estimation of Window Queries

Post Info
More Details (n/a)

Added	16 Aug 2010
Updated	16 Aug 2010
Type	Conference
Year	2010
Where	PODC
Authors	Keren Censor Hillel, Hadas Shachnai

Comments (0)