3928 search results - page 200 / 786 » order 2006 |
185
click to vote
COMBINATORICS
2004
15 years 7 months ago
2004
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...
181
click to vote
JMIV
2000
15 years 7 months 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,...
179
click to vote
JSA
2000
15 years 7 months 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 ...
204
click to vote
PPL
2000
15 years 7 months 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 ...
172
click to vote
FUIN
2002
15 years 7 months ago
2002
This paper deals with iterated belief change and proposes a drastic revision rule that modifies a plausibility ordering of interpretations in such a way that any world where the in...