Sciweavers

1039 search results - page 90 / 208
» networks 1998
Sort
View
MST
1998
75views more  MST 1998»
13 years 8 months ago
Periodic Merging Networks
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...
ICNP
1998
IEEE
14 years 1 months ago
Maximizable Routing Metrics
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 ...
Mohamed G. Gouda, Marco Schneider
ICIP
1998
IEEE
14 years 10 months ago
A Neural Network based Scheme for Unsupervised Video Object Segmentation
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...
SIAMCOMP
1998
124views more  SIAMCOMP 1998»
13 years 8 months ago
Near-Linear Time Construction of Sparse Neighborhood Covers
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)...
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, Davi...
ATMOS
2010
169views Optimization» more  ATMOS 2010»
13 years 7 months ago
Traffic Signal Optimization Using Cyclically Expanded Networks
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...
Ekkehard Köhler, Martin Strehler