1282 search results - page 117 / 257 » Algorithms for Large, Sparse Network Alignment Problems |
107
click to vote
INFOCOM
1997
IEEE
15 years 6 months ago
1997
IEEE
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
129
Voted
SIAMMAX
2010
14 years 9 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
129
click to vote
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
124
click to vote
TPDS
2008
15 years 2 months ago
2008
It is anticipated that a large amount of multicast traffic needs to be supported in future communication networks. The network coding technique proposed recently is promising for e...
104
click to vote
DAC
2007
ACM
16 years 3 months ago
2007
ACM
With increasing time-to-market pressure and shortening semiconductor product cycles, more and more chips are being designed with library-based methodologies. In spite of this shif...