翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

disperser : ウィキペディア英語版
disperser

A disperser is a one-sided extractor.〔Ronen Shaltiel. Recent developments in explicit construction of extractors. P. 7.〕 Where an extractor requires that every event gets the same probability under the uniform distribution and the extracted distribution, only the latter is required for a disperser. So for a disperser, an event A \subseteq \^ we have:
Pr_^\times \^\rightarrow \^
''such that for every distribution'' X ''on'' \^ ''with'' H_(X) \geq k ''the support of the distribution'' Dis(X,U_) ''is of size at least'' (1-\epsilon)2^.
==Graph theory==
An (''N'', ''M'', ''D'', ''K'', ''e'')-disperser is a bipartite graph with ''N'' vertices on the left side, each with degree ''D'', and ''M'' vertices on the right side, such that every subset of ''K'' vertices on the left side is connected to more than (1 − ''e'')''M'' vertices on the right.
An extractor is a related type of graph that guarantees an even stronger property; every (''N'', ''M'', ''D'', ''K'', ''e'')-extractor is also an (''N'', ''M'', ''D'', ''K'', ''e'')-disperser.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「disperser」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.