Sciweavers

2497 search results - page 43 / 500
» Requirements for models of achievable routing
Sort
View
SKG
2005
IEEE
15 years 7 months ago
Improving Searching Performance Based on Semantic Correlativity in Peer to Peer Network
Most existing Peer-to-peer (P2P) systems support only title-based searches, which can not satisfy the content searches. In this paper, we proposed a semantic correlativity model wh...
Zhichao Li, Pilian He, Feng Li, Ming Lei
IRCDL
2007
15 years 3 months ago
Semantic Routing for Effective Search in Heterogeneous and Distributed Digital Libraries
— Next generation Digital Libraries (DLs) will offer an entire ensemble of systems and services designed to help users to easily find and access the information they are looking...
Federica Mandreoli, Riccardo Martoglia, Wilma Penz...
NOSSDAV
2009
Springer
15 years 8 months ago
A delaunay triangulation architecture supporting churn and user mobility in MMVEs
This article proposes a new distributed architecture for update message exchange in massively multi-user virtual environments (MMVE). MMVE applications require delivery of updates...
Mohsen Ghaffari, Behnoosh Hariri, Shervin Shirmoha...
INFOCOM
2010
IEEE
15 years 1 days ago
Random Walks on Digraphs: A Theoretical Framework for Estimating Transmission Costs in Wireless Routing
—In this paper we develop a unified theoretical framework for estimating various transmission costs of packet forwarding in wireless networks. Our framework can be applied to th...
Yanhua Li, Zhi-Li Zhang
SPAA
2006
ACM
15 years 7 months ago
On space-stretch trade-offs: lower bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi