نتایج جستجو برای: hartogs triangle
تعداد نتایج: 15392 فیلتر نتایج به سال:
A version of the Erdös-Rado theorem on partitions of the unordered ntuples from uncountable sets is proved, without using the axiom of choice. The case with exponent 1 is just the Sierpinski-Hartogs’ result that א(α) ≤ 2 2α . The liberal use made by Erdös and Rado in [2] of the cardinal arithmetic versions of the axiom of choice enables them to give their result a particularly simple expression...
In this letter, we study the problem of designing an efficient power and bit allocation scheme in the context of a hierarchical image transmission system based on an embedded multi-carrier modulation (EMCM) scheme over digital subscriber line. Authors describe a novel algorithm that performs power minimization under bit rate constraint and QoS requirement. It is based on the Hughes-Hartogs algo...
The flexible adaption of the transmission scheme to the current channel state becomes more and more a key issue in future communication systems. One efficient solution in multicarrier systems like Orthogonal Frequency Division Multiplexing (OFDM) has been proven to be adaptive modulation (AM) where the modulation scheme is selected on a subcarrier-basis or group of subcarriers. A lot of researc...
The intersection between 3D objects plays a prominent role in spatial reasoning, geometric modeling and computer vision. Detection of possible intersection between objects can be based on the objects’ triangulated boundaries, leading to computing triangle-triangle intersection. Traditionally there are separate algorithms for cross intersection and coplanar intersection. There is no single algor...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید