2080 search results - page 308 / 416 » Measuring empirical computational complexity |
161
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
157
click to vote
IPSN
2010
Springer
16 years 1 months ago
2010
Springer
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
155
click to vote
WSDM
2009
ACM
16 years 1 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
170
click to vote
HT
2009
ACM
16 years 25 days ago
2009
ACM
The Social Web is successfully established and poised for continued growth. Web 2.0 applications such as blogs, bookmarking, music, photo and video sharing systems are among the m...
187
click to vote
SIGCOMM
2009
ACM
16 years 25 days ago
2009
ACM
While some empirical studies on Online Social Networks (OSNs) have examined the growth of these systems, little is known about the patterns of decline in user population or user a...