206 search results - page 13 / 42 » A Routing Mechanism Based on Social Networks and Betweenness... |
INFOCOM
2010
IEEE
13 years 8 months ago
2010
IEEE
— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes t...
ESWS
2006
Springer
14 years 2 months ago
2006
Springer
A key argument for modeling knowledge in ontologies is the easy re-use and re-engineering of the knowledge. However, beside consistency checking, current ontology engineering tools...
MHCI
2005
Springer
14 years 3 months ago
2005
Springer
As small digital cameras become more popular, opportunities to take photos are rapidly increasing. Photo sharing is a great way to maintain and revitalize relationships between fa...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
INFOCOM
2006
IEEE
14 years 4 months ago
2006
IEEE
— Disruption-tolerant networks (DTNs) attempt to route network messages via intermittently connected nodes. Routing in such environments is difficult because peers have little i...