66 search results - page 9 / 14 » Cycles in dense digraphs |
ICN
2005
Springer
14 years 2 months ago
2005
Springer
ESCORT aims at decreasing the energy cost of communication in dense sensor networks. We employ radio frequency (RF) signal quality assessment in forming communities of redundant no...
WEA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
APVIS
2007
13 years 10 months ago
2007
In this paper, we present a case study for the visualisation and analysis of large and complex temporal multivariate networks derived from the Internet Movie DataBase (IMDB). Our ...
SNPD
2007
13 years 10 months ago
2007
In this paper, we propose a new class of interconnection networks, called “biswapped networks” (BSNs). Each BSN is built of 2n copies of some n-node basis network using a simp...
IJCV
2002
13 years 8 months ago
2002
In telepresence applications each user is immersed in a rendered 3D-world composed from representations transmitted from remote sites. The challenge is to compute dense range data...