547 search results - page 31 / 110 » Efficient Model Update for General Link-Insertion Networks |
SIGMETRICS
2008
ACM
14 years 9 months ago
2008
ACM
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
TON
2008
14 years 9 months ago
2008
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
MOBIHOC
2009
ACM
15 years 10 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
112
click to vote
ANCS
2005
ACM
15 years 3 months ago
2005
ACM
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...