828 search results - page 37 / 166 » Simplicial Powers of Graphs |
WWW
2004
ACM
14 years 9 months ago
2004
ACM
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
DATE
2004
IEEE
14 years 12 days ago
2004
IEEE
Many high-end DSP processors employ both multiple memory banks and heterogeneous register files to improve performance and power consumption. The complexity of such architectures ...
COLING
2008
13 years 10 months ago
2008
Treating classification as seeking minimum cuts in the appropriate graph has proven effective in a number of applications. The power of this approach lies in its ability to incorp...
INFOCOM
1993
IEEE
14 years 23 days ago
1993
IEEE
Passive, single-hop interconnections among N stations, each with several transmitters and receivers, provide a communication path between any two stations using one of the transmi...
PPOPP
2012
ACM
12 years 4 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...