Sciweavers

5922 search results - page 450 / 1185
» Navigability of Complex Networks
Sort
View
160
Voted
SASN
2003
ACM
15 years 10 months ago
SECTOR: secure tracking of node encounters in multi-hop wireless networks
In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be u...
Srdjan Capkun, Levente Buttyán, Jean-Pierre...
CIKM
2003
Springer
15 years 10 months ago
Content-based retrieval in hybrid peer-to-peer networks
Hybrid peer-to-peer architectures use special nodes to provide directory services for regions of the network (“regional directory services”). Hybrid peer-to-peer architectures...
Jie Lu, James P. Callan
148
Voted
CDC
2009
IEEE
111views Control Systems» more  CDC 2009»
15 years 9 months ago
Minimal dynamical structure realisations with application to network reconstruction from data
— Network reconstruction, i.e., obtaining network structure from data, is a central theme in systems biology, economics, and engineering. Previous work introduced dynamical struc...
Ye Yuan, Guy-Bart Vincent Stan, Sean Warnick, Jorg...
122
Voted
IPPS
2000
IEEE
15 years 9 months ago
Optimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper,...
Yuanyuan Yang, Jianchao Wang
153
Voted
PPOPP
1999
ACM
15 years 9 months ago
Automatic Node Selection for High Performance Applications on Networks
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...
Jaspal Subhlok, Peter Lieu, Bruce Lowekamp