Sciweavers

1578 search results - page 40 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
IPPS
1998
IEEE
14 years 27 days ago
Tree-Based Multicasting in Wormhole-Routed Irregular Topologies
A deadlock-free tree-based multicast routing algorithm is presented for all direct networks, regardless of interconnection topology. The algorithm delivers a message to any number...
Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Raja...
FPGA
1995
ACM
149views FPGA» more  FPGA 1995»
14 years 6 days ago
PathFinder: A Negotiation-based Performance-driven Router for FPGAs
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
Larry McMurchie, Carl Ebeling
ISCAS
2005
IEEE
130views Hardware» more  ISCAS 2005»
14 years 2 months ago
Spatial error concealment based on directional decision and intra prediction
—The paper presents a novel spatial error concealment algorithm based on directional decision and intra prediction. Unlike previous approaches that simultaneously recover the pix...
Yan Zhao, Dong Tian, M. M. Hannukasela, Moncef Gab...
ICDCS
2007
IEEE
14 years 3 months ago
Overlay Node Placement: Analysis, Algorithms and Impact on Applications
Abstract— Overlay routing has emerged as a promising approach to improving performance and reliability of Internet paths. To fully realize the potential of overlay routing under ...
Sabyasachi Roy, Himabindu Pucha, Zheng Zhang, Y. C...
ICPR
2008
IEEE
14 years 3 months ago
Direct 3-D shape recovery from image sequence based on multi-scale Bayesian network
We propose a new method for recovering a 3-D object shape from an image sequence. In order to recover high-resolution relative depth without using the complex Markov random field...
Norio Tagawa, Junya Kawaguchi, Shoichi Naganuma, K...