50 search results - page 5 / 10 » Advanced Shortest Paths Algorithms on a Massively-Multithrea... |
120
click to vote
HICSS
2003
IEEE
15 years 2 months ago
2003
IEEE
Multicasting is an efficient and effective approach for supporting content distribution based on the current Internet infrastructure. In this paper, we have proposes the source-in...
84
Voted
PODC
2006
ACM
15 years 3 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
78
Voted
DAC
2005
ACM
15 years 10 months ago
2005
ACM
While performance specifications are verified before sign-off for a modern nanometer scale design, extensive application of optical proximity correction substantially alters the l...
92
Voted
MOBICOM
2003
ACM
15 years 2 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
85
Voted
ICPP
2006
IEEE
15 years 3 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...