Results 271 to 280 of about 114,934,093 (299)
Some of the next articles are maybe not open access.
Fréchet-Distance on Road Networks
2011As a measure for the resemblance of tracks in a network graph, we consider the so-called Freechet-distance based on network distance. For paths P and Q consisting of p and q consecutive edges, an O((p2+q2)logpq) time algorithm measuring the Freechet-distance between P and Q is developed.
Chenglin Fan, Jun Luo 0008, Binhai Zhu
openaire +2 more sources
The dissemination distance of mobile opportunistic networks
Personal and Ubiquitous Computing, 2014Mobile opportunistic networks can realize self organizing communications for complicated and dynamic scenarios, which makes them expected to support various applications. In this paper, we investigate how far the data can reach within time t (i.e.
Xia Wang 0019 +4 more
openaire +3 more sources
An introduction to spectral distances in networks
2011Many functions have been recently defined to assess the similarity among networks as tools for quantitative comparison. They stem from very different frameworks - and they are tuned for dealing with different situations. Here we show an overview of the spectral distances, highlighting their behavior in some basic cases of static and dynamic synthetic ...
Giuseppe Jurman +2 more
openaire +1 more source
Distance routing on series parallel networks
Proceedings of 16th International Conference on Distributed Computing Systems, 2002We consider the problem of routing messages on Series Parallel Graphs (SPGs) and we introduce a new technique called Distance Routing. This technique is based on the idea of encoding in the label of each node x some information about a shortest path from the source of the SPG to x, and from x to the terminal node of the SPG.
P. FLOCCHINI, LUCCIO, Flaminia
openaire +2 more sources
On Distances in Uniformly Random Networks
IEEE Transactions on Information Theory, 2005The distribution of Euclidean distances in Poisson point processes is determined. The main result is the density function of the distance to the n-nearest neighbor of a homogeneous process in Ropfm, which is shown to be governed by a generalized Gamma distribution.
openaire +2 more sources
A New Distance Function for Modeling Travel Distances in a Transportation Network
Transportation Science, 1992Continuous location models generally use the Euclidean or rectangular norm to approximate travel in a transportation network. This paper considers a new and more accurate distance measure, termed the weighted one-two norm, which is a positive linear combination of the preceding norms.
Jack Brimberg, Robert F. Love
openaire +3 more sources
Networking and Distance Education
Educational Media International, 1990Abstract The article looks at how the concept of distance is changing with the use of modern networking. It then looks at the work done by the Tele‐universite leading to advances in international working using live television direct by satellite between many nations, and the great advantages for these nations of tele‐conferencing and tele‐working.
Kim Chi Dao +3 more
openaire +1 more source
2016
Networks of interactions are increasingly used to model biological systems. The patterns of these networks capture a larger, more complex, representation of the whole than any single attribute can. Networks allow the modelling of far more complicated systems, at the expense of more computationally complex analysis.
openaire +1 more source
Networks of interactions are increasingly used to model biological systems. The patterns of these networks capture a larger, more complex, representation of the whole than any single attribute can. Networks allow the modelling of far more complicated systems, at the expense of more computationally complex analysis.
openaire +1 more source
Identifying influential nodes in complex networks: Effective distance gravity model
Information Sciences, 2021Yong Deng, Kang Hao Cheong
exaly