2473 search results - page 190 / 495 » The Logic of Communication Graphs |
147
click to vote
WICON
2008
15 years 5 months ago
2008
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
133
click to vote
JGAA
2000
15 years 3 months ago
2000
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
141
click to vote
JGAA
2002
15 years 3 months ago
2002
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
115
Voted
IFIPTCS
2010
15 years 1 months ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
151
click to vote
IMC
2010
ACM
15 years 1 months ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...