1629 search results - page 44 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
100
click to vote
TCOM
2008
14 years 9 months ago
2008
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...
ICCAD
2009
IEEE
14 years 7 months ago
2009
IEEE
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...
SRDS
1998
IEEE
15 years 2 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
104
click to vote
NIPS
2008
14 years 11 months ago
2008
Semantic hashing[1] seeks compact binary codes of data-points so that the Hamming distance between codewords correlates with semantic similarity. In this paper, we show that the p...
JCM
2006
14 years 9 months ago
2006
This paper investigates the application of the delayed normalized least mean square (DNLMS) algorithm to echo cancellation. In order to reduce the amount of computations, DNLMS is ...