625 search results - page 42 / 125 » Approximating Travel Times Using Opportunistic Networking |
183
click to vote
VLDB
2006
ACM
16 years 9 hour ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
ADHOCNOW
2004
Springer
15 years 5 months ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
103
click to vote
KDD
2009
ACM
16 years 10 days ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
ESA
2004
Springer
15 years 5 months ago
2004
Springer
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
Ad hoc networks formed by traveling vehicles are envisaged to become a common platform that will support a wide variety of applications, ranging from road safety to advertising an...