1253 search results - page 140 / 251 » order 2000 |
105
Voted
DAM
2000
15 years 28 days ago
2000
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
96
Voted
JMIV
2000
15 years 27 days ago
2000
In this paper, we formally connect between vector median filters, inf-sup morphological operations, and geometric partial differential equations. Considering a lexicographic order,...
98
Voted
JSA
2000
15 years 27 days ago
2000
This paper presents an efficient routing and flow control mechanism to implement multidestination message passing in wormhole networks.It is targeted to situations where the size ...
145
Voted
PE
2000
Springer
15 years 26 days ago
2000
Springer
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
107
Voted
PPL
2000
15 years 26 days ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...