Sciweavers

15251 search results - page 2702 / 3051
» Network Science - Theory and Application
Sort
View
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
16 years 2 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
154
Voted
SOSP
2003
ACM
16 years 1 months ago
Upgrading transport protocols using untrusted mobile code
In this paper, we present STP, a system in which communicating end hosts use untrusted mobile code to remotely upgrade each other with the transport protocols that they use to com...
Parveen Patel, Andrew Whitaker, David Wetherall, J...
IPSN
2009
Springer
15 years 11 months ago
Recovering temporal integrity with Data Driven Time Synchronization
Data Driven Time Synchronization (DDTS) provides synchronization across sensors by using underlying characteristics of data collected by an embedded sensing system. We apply the c...
Martin Lukac, Paul Davis, Robert Clayton, Deborah ...
INFOCOM
2009
IEEE
15 years 11 months ago
Rateless Coding with Feedback
The erasure resilience of rateless codes, such as Luby-Transform (LT) codes, makes them particularly suitable to a wide variety of loss-prone wireless and sensor network applicati...
Andrew Hagedorn, Sachin Agarwal, David Starobinski...
EUROPAR
2009
Springer
15 years 11 months ago
Adaptive Peer Sampling with Newscast
Abstract. The peer sampling service is a middleware service that provides random samples from a large decentralized network to support gossip-based applications such as multicast, ...
Norbert Tölgyesi, Márk Jelasity
« Prev « First page 2702 / 3051 Last » Next »