1986 search results - page 151 / 398 » Path Separability of Graphs |
INFOCOM
2012
IEEE
12 years 16 days ago
2012
IEEE
—Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings a...
ICCAD
2001
IEEE
14 years 7 months ago
2001
IEEE
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
DASFAA
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract. Privacy becomes a major concern for both customers and enterprises in today’s corporate marketing strategies, many research efforts have been put into developing new p...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...
MSN
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...