Search results
Jump to navigation
Jump to search
Page title matches
- {{nihongo|'''Darkside Communication Group'''|暗黒通信団|Ankoku Tsuushin dan}} is a publishing group of Japanese [[Dō ...6 KB (714 words) - 10:00, 18 November 2024
- ...of two costs (in terms of time and energy): arithmetic and communication. Communication, in this context refers to moving data, either between levels of memory or A common computational model in analyzing communication-avoiding algorithms is the two-level memory model: ...13 KB (1,863 words) - 21:54, 17 April 2024
- ...lements. The topology allows for an efficient implementation of some basic communication primitives such as [[Broadcasting (networking)|Broadcast]], All-[[Reduce (p ...''Operation''', and '''Output''' are placeholders that depend on the given communication primitive (see next section). ...10 KB (1,566 words) - 06:47, 17 February 2025
- In the study of [[parallel algorithm]]s, the '''massively parallel communication''' model or '''MPC model''' is a theoretical model of computing, intended a ...t of information sent or received by a single machine in a single round of communication must be <math>O(S)</math>. The goal in designing algorithms for this model ...6 KB (931 words) - 07:21, 5 December 2024
- ...ter science]], '''multiparty communication complexity''' is the study of [[communication complexity]] in the setting where there are more than 2 players. In the traditional two–party [[communication complexity|communication game]], introduced by {{harvtxt|Yao|1979}},<ref>{{citation ...7 KB (1,108 words) - 03:25, 23 February 2025
Page text matches
- ...ected through an abstract communication medium which allows point-to-point communication. This model is pair-wise synchronous and overall asynchronous. * <math>L</math>, the [[Latency (engineering)|latency]] of the communication medium. ...2 KB (308 words) - 23:31, 11 July 2023
- ...r science]], the '''log-rank conjecture''' states that the deterministic [[communication complexity]] of a two-party [[Boolean function]] is polynomially related to | title = Möbius Functions and Communication Complexity ...4 KB (494 words) - 11:29, 17 December 2023
- ...the advantages of [[Electronic communication|electronic]] and [[optical communication]].<ref>[http://www.scpe.org/vols/vol09/no1/SCPE_9_1_08.pdf SCALABLE COMPU ...sm, high [[:wikt:connectivity|connectivity]] and large bandwidth. When the communication distances exceed a few millimeters, optical interconnects provide advantage ...3 KB (383 words) - 22:24, 2 November 2024
- {{Short description|Problem in communication complexity theory}} ...f Alice and Bob are each given <math>n</math>-bit strings, there exists no communication protocol that lets Alice compute the hamming distance between their strings ...5 KB (788 words) - 02:36, 1 February 2023
- ...(engineering)|latency]], or time at which a processor takes to initiate a communication on a network. *<math>T_{comm}</math> is the time spent in communication on the network. ...2 KB (359 words) - 01:19, 15 September 2024
- If [[Alice and Bob|Alice]] (A) initiates the communication to Bob (B) with S is a server trusted by both parties, the protocol can be :Alice notified Bob of intent to initiate secure communication. ...4 KB (629 words) - 04:08, 6 May 2023
- {{Short description|Jargon and science communication}} ...Davis |first7=Kent |date=2018 |title=STEM Storytellers: Improving the Oral Communication Skills of STEM Graduate Students |url=https://monolith.asee.org/public/conf ...3 KB (382 words) - 08:40, 5 October 2024
- [[File:All 2 all vis 4 pes.jpg|thumb|400px|A visualization for an all-to-all communication with four processors and m=1.]] ...all-to-all algorithm requires at least <math>\lceil \log_2 n\rceil</math> communication rounds. Further a minimum of <math>\left\lceil m(n-1)\right\rceil</math> un ...7 KB (1,067 words) - 05:46, 31 December 2023
- ...ter science]], '''multiparty communication complexity''' is the study of [[communication complexity]] in the setting where there are more than 2 players. In the traditional two–party [[communication complexity|communication game]], introduced by {{harvtxt|Yao|1979}},<ref>{{citation ...7 KB (1,108 words) - 03:25, 23 February 2025
- ...s optimally transfers partial information using entanglement and classical communication. It allows for sending information using an amount of entanglement given by .../math>. The case where the classical communication is replaced by quantum communication was considered in.<ref>{{cite journal|arxiv=quant-ph/0606225 |doi=10.1098/ ...3 KB (424 words) - 16:42, 12 May 2022
- ...York|isbn=978-1461403647|pages=281|edition=3rd}}</ref> It's mainly used in communication systems.<ref name=Book1/> * {{cite book|last=Simon|first=Marvin K.|title=Digital Communication over Fading Channels|year=2005|publisher=John Wiley & Sons|location=Hoboken ...4 KB (559 words) - 09:29, 13 February 2024
- ...ation games on networks. The solution concept and the class of cooperative communication games it applies to was introduced by [[Roger Myerson]] in 1977.<ref name = === Communication games === ...7 KB (1,172 words) - 07:21, 17 February 2025
- ...computing |chapter=Exponential separation of quantum and classical one-way communication complexity |date=2004-06-13|chapter-url=https://doi.org/10.1145/1007352.100 ...C-2020-1.pdf|journal=15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)|series=Leibniz International Proceedings in Inf ...9 KB (1,340 words) - 03:44, 29 July 2024
- ...lements. The topology allows for an efficient implementation of some basic communication primitives such as [[Broadcasting (networking)|Broadcast]], All-[[Reduce (p ...''Operation''', and '''Output''' are placeholders that depend on the given communication primitive (see next section). ...10 KB (1,566 words) - 06:47, 17 February 2025
- ...rst1=Stephen |author1-link=Stephen Morris (economist) |title=Coordination, Communication, and Common Knowledge: a Retrospective on the Electronic-mail Game |journal === Email communication === ...6 KB (1,016 words) - 12:44, 8 January 2025
- ...|author=Shannon, Claude E. |date=July 1948 |title=A Mathematical Theory of Communication [reprint with corrections] |url=http://math.harvard.edu/~ctm/home/text/othe ...ctm/home/text/others/shannon/entropy/entropy.pdf "A Mathematical Theory of Communication."] ACM SIGMOBILE mobile computing and communications review 5.1 (2001): 3-5 ...3 KB (505 words) - 01:53, 6 December 2024
- ...line carrier systems''', is a standard for low-speed reliable [[power line communication]]s by [[electricity meter]]s, [[water meter]]s and [[SCADA]].<ref>IEC 61334 *IEC 61334-4-1:1996 Data communication protocols – Reference model of the communication system ...7 KB (1,079 words) - 21:46, 16 August 2021
- ...of two costs (in terms of time and energy): arithmetic and communication. Communication, in this context refers to moving data, either between levels of memory or A common computational model in analyzing communication-avoiding algorithms is the two-level memory model: ...13 KB (1,863 words) - 21:54, 17 April 2024
- ...to analyze the effect of [[Interference (communication)|interference]] in communication channels. The model consists of two pairs of users communicating through a ...channel the presence of the signal from the other user may also impair the communication. However, since the transmitted signals are not purely random (otherwise th ...4 KB (551 words) - 01:23, 31 January 2024
- ...utation time is the time required to perform the computation of a task and communication time is the time required to exchange data between processors.<ref name = " ...omp}}}} is the computation time and {{math|''T''{{sub|comm}}}} denotes the communication time, then the granularity {{mvar|G}} of a task can be calculated as:<ref n ...11 KB (1,632 words) - 15:47, 30 October 2024