4009 search results - page 712 / 802 » Clustering on Complex Graphs |
141
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
It has recently been observed that the node degrees of many real-world large-scale networks, such as the Internet and the Web, follow a power law distributions. Since the classical...
149
click to vote
DCOSS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
141
click to vote
FPGA
2005
ACM
15 years 10 months ago
2005
ACM
Logic duplication is an effective method for improving circuit performance. In this paper we present an algorithm named SPD that performs simultaneous placement and duplication to...
133
click to vote
GCC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In peer-to-peer (P2P) overlay networks, the mechanism of a peer randomly joining and leaving a network, causes a topology mismatch between the overlay and the underlying ...
127
click to vote
GD
2005
Springer
15 years 10 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...