نتایج جستجو برای: pairwise s

تعداد نتایج: 730727  

1996
Benoit Huet Edwin R. Hancock

This paper aims to develop simple statistical methods for indexing line patterns. The application vehicle used in this study involves indexing into an aerial image database using a cartographic model. The images contained in the database are of urban and semi-urban areas. The cartographic model represents a road network known to appear in a subset of the images contained within the database. Th...

2000
Salam A. Zummo Saud A. Al-Semari

This paper presents the performance of Space-Time (ST) codes over rapid fading channels. A tight upper bound on the pairwise error probability (PWEP) of ST codes over rapid fading channels is derived. Also, an upper bound on the bit error probability (BEP) is evaluated using the derived PWEP. The existing and new bounds are evaluated for different QPSK ST codes and compared to the simulation re...

1996
Sophie Frisch

Let R be a Krull ring with quotient field K and a1, . . . , an in R. If and only if the ai are pairwise incongruent mod every height 1 prime ideal of infinite index in R does there exist for all values b1, . . . , bn in R an interpolating integer-valued polynomial, i.e., an f ∈ K[x] with f(ai) = bi and f(R) ⊆ R. If S is an infinite subring of a discrete valuation ring Rv with quotient field K a...

Journal: :Int. J. Game Theory 2009
Antoni Calvó-Armengol Rahmi Ilkiliç

Suppose that individual payo¤s depend on the network connecting them. Consider the following simultaneous move game of network formation: players announce independently the links they wish to form, and links are formed only under mutual consent. We provide necessary and su¢ cient conditions on the network link marginal payo¤s such that the set of pairwise stable, pairwise-Nash and proper equili...

2013
Zhi-Wei Sun ZHI-WEI SUN

For n = 1, 2, 3, . . . define S(n) as the smallest integer m > 1 such that those 2k(k − 1) mod m for k = 1, . . . , n are pairwise distinct; we show that S(n) is the least prime greater than 2n− 2 and hence the value set of the function S(n) is exactly the set of all prime numbers. For every n = 4, 5, . . . , we prove that the least prime p > 3n with p ≡ 1 (mod 3) is just the least positive int...

Journal: :bulletin of the iranian mathematical society 2013
a. kilicman z. salleh

in the present paper we introduce and study the notion of pairwise weakly lindelof bitopological spaces and obtain some results. further, we also study the pairwise weakly lindelof subspaces and subsets, and investigate some of their properties. it was proved that a pairwise weakly lindelof property is not a hereditary property.

Journal: :Int. J. Comput. Geometry Appl. 2007
Mireille Boutin Gregor Kemper

In a previous paper we showed that, for any , most sets of points in are determined (up to rotations, reflections, translations and relabeling of the points) by the distribution of their pairwise distances. But there are some exceptional point configurations which are not reconstructible from the distribution of distances in the above sense. In this paper, we concentrate on the planar case and ...

Journal: :IEEE Trans. Communications 2002
Jürgen Häring A. J. Han Vinck

The transmission over the memoryless additive white Class-A noise (AWCN) channel is considered. For uncoded transmission, an exact expression for the symbol error rate is derived. For coded transmission, the Chernoff bound on the pairwise error probability is calculated and the performance achieved on the real and the complex AWCN channels is compared. Moreover, a lowcomplexity, suboptimum deco...

Journal: :IEEE Trans. Fuzzy Systems 1998
Joongseon Joh Ye-Haw Chen Reza Langari

Stability issues of linear Takagi–Sugeno (T–S) fuzzy models are investigated. We first propose a systematic way of searching for a common matrix, which, in turn, is related to stability for N subsystems that are under a pairwise commutative assumption. The robustness issue under uncertainty in each subsystem is then considered. We then show that the pairwise commutative assumption can, in fact,...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید