Sciweavers

474 search results - page 61 / 95
» On Multicast Path Finding Algorithms
Sort
View
ISAAC
2000
Springer
110views Algorithms» more  ISAAC 2000»
13 years 11 months ago
Online Routing in Convex Subdivisions
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante ...
AAAI
2000
13 years 9 months ago
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
Richard E. Korf, Weixiong Zhang
ASAP
2007
IEEE
95views Hardware» more  ASAP 2007»
14 years 2 months ago
Performance Evaluation of Probe-Send Fault-tolerant Network-on-chip Router
With increasing reliability concerns for current and next generation VLSI technologies, fault-tolerance is fast becoming an integral part of system-on-chip and multicore architect...
Sumit D. Mediratta, Jeffrey T. Draper
CVPR
2006
IEEE
14 years 9 months ago
The Bottleneck Geodesic: Computing Pixel Affinity
A meaningful affinity measure between pixels is essential for many computer vision and image processing applications. We propose an algorithm that works in the features' hist...
Ido Omer, Michael Werman
FGCN
2007
IEEE
121views Communications» more  FGCN 2007»
14 years 2 months ago
Supporting Multimedia Communication within an 802.11g Ad-hoc Network
By investigating the experimental results of the average throughput with the 802.11g ad-hoc mode, we have collected the different performance characteristics among the indoor, the ...
Chung-Wei Lee, Jonathan Liu, Kun Chen, Yu-Chee Tse...