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 ...
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...
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...
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...
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...