117 search results - page 10 / 24 » Routing on Trees via Matchings |
84
Voted
DAC
2006
ACM
15 years 10 months ago
2006
ACM
As the technology node advances into the nanometer era, via-open defects are one of the dominant failures. To improve via yield and reliability, redundant-via insertion is a highl...
WWW
2006
ACM
15 years 10 months ago
2006
ACM
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
84
Voted
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
127
click to vote
CN
2008
14 years 9 months ago
2008
act 11 Overlay multicasting has been proposed for implementing multicast routing in the application layer as a practical alter12 native to IP multicasting. Since a packet in overla...