We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcherâ...
Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oes...
We develop a theory for deciding, for any routing metric and any network, whether the messages in this network can be routed along paths whose metric values are maximum. In order ...
In this paper, we proposed a neural network based scheme for performing unsupervised video object segmentation, especially for videophone or videoconferencing applications. The pr...
Anastasios D. Doulamis, Nikolaos D. Doulamis, Stef...
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
Traditionally, the coordination of multiple traffic signals and the traffic assignment problem in an urban street network are considered as two separate optimization problems. How...