Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...ecific nonlinear transformation plays an important role in optical quantum computing. ==Connections to quantum computing== ...
    4 KB (543 words) - 21:47, 19 January 2022
  • ...es that a large number of [[renewal process]]es, not necessarily [[Poisson process|Poissonian]], when combined ("superimposed") will have Poissonian propertie ...ng theory]]. It is also used in dependability and reliability modelling of computing and [[telecommunications]]. ...
    2 KB (318 words) - 17:04, 8 September 2022
  • ...cription|Number of bits needed to represent an integer datum or message in computing and communications}} ...elecommunications devices (as opposed to [[analog signal|analog]] devices) process data that is encoded in [[binary code|binary]] format. The binary format ex ...
    2 KB (306 words) - 12:56, 29 June 2024
  • ...ems and Networks |chapter=SWIM: Scalable weakly-consistent infection-style process group membership protocol |date=June 23, 2002|chapter-url=https://ieeexplor * [[Crash (computing)]] ...
    5 KB (650 words) - 19:14, 14 February 2025
  • * [[Probably approximately correct learning]]: A process for machine-learning in which the learned function has low generalization-e ...col|Gossip protocols]]: a [[communication protocol]] used in [[Distributed computing|distributed systems]] to reliably deliver messages to the whole cluster usi ...
    3 KB (429 words) - 02:19, 9 January 2025
  • ...3=T. R.|last4=Emma|first4=P. G.|title=Proceedings of the 3rd conference on Computing frontiers |chapter=Cache miss behavior |date=2006-01-01|chapter-url=http:// ...so on the temporal re-reference pattern of cache blocks in a process. If a process has a small working memory set relative to the cache size, capacity misses ...
    4 KB (631 words) - 16:46, 8 August 2023
  • ...ute ''r'' calls requiring use of the route arrive according to a [[Poisson process]] of rate ''v''<sub>''r''</sub>. When a call arrives if there is sufficient ...b>2</sub>, ... , ''C''<sub>''J''</sub>). Then the [[continuous-time Markov process]] ''n''(''t'') has unique stationary distribution<ref name="ln" /> ...
    5 KB (683 words) - 22:00, 8 May 2024
  • ...caltech.edu/ph219/topological.pdf John Preskill's lecture notes on quantum computing, section 9.14]</ref><ref name=":72">{{Cite book |last=Simon |first=Steven H ...e measurements, and hence form a natural setting for [[topological quantum computing]]. This is in contrast to anyons based on discrete [[gauge theory]], which ...
    8 KB (1,088 words) - 04:43, 1 March 2025
  • '''Uncomputation''' is a technique, used in [[Reversible computing|reversible]] circuits, for cleaning up temporary effects on [[Ancilla Bit|a Uncomputation is a fundamental step in [[quantum computing]] algorithms. Whether or not intermediate effects have been uncomputed affe ...
    2 KB (337 words) - 18:51, 5 January 2025
  • <!-----Process observations-----> <!---Process variation chart---> ...
    6 KB (857 words) - 00:34, 31 December 2024
  • ==Computing== ...s of spiking neurons and dynamical synapses |series=Perspectives in Neural Computing |isbn=978-3-540-76263-8 |citeseerx=10.1.1.56.272 }}</ref> ...
    5 KB (676 words) - 06:23, 16 April 2024
  • ...e'''. In domains where computations are expected to be infinite, such as [[process calculi]], a computation is said to diverge if it fails to be productive (i ...258-0 |isbn=978-1-84882-257-3 }}</ref> For example, consider the following process, defined by CSP notation: ...
    4 KB (618 words) - 18:04, 20 November 2024
  • In computing and communication systems, a '''work-conserving scheduler''' is a [[schedul ...s/cores are not idle if there are processes/threads ready for [[Execution (computing)|execution]]. ...
    5 KB (838 words) - 06:24, 31 July 2024
  • {{short description|Measure of the amount of work needed to perform a computing task}} ...omputing]], '''granularity''' (or [[granulation|grain]] size) of a [[task (computing)|task]] is a measure of the amount of work (or [[computation]]) which is pe ...
    11 KB (1,632 words) - 15:47, 30 October 2024
  • ...t Puzzle Protocol|computation-based puzzle protocols]], in which [[Client (computing)|clients]] are required to compute hard CPU or memory-bound puzzles that fa ...omplete a guided tour puzzle prior to receiving service from the [[Server (computing)|server]], if the server suspects it is currently under [[Denial-of-service ...
    10 KB (1,646 words) - 22:41, 18 January 2024
  • In distributed computing, shared-memory systems and [[message-passing]] systems are two widely studi ...=Kshemkalyani|first1=Ajay D.|last2=Singhal|first2=Mukesh|title=Distributed computing : principles, algorithms, and systems|url=https://archive.org/details/distr ...
    10 KB (1,540 words) - 05:29, 29 September 2024
  • {{Short description|Data structure in distributed computing}} ...lues stored in individual registers can be changed at any time during this process. To solve this problem, snapshot objects store a vector of ''n'' components ...
    25 KB (3,763 words) - 05:51, 18 November 2024
  • ...ete cosine transform]]s (DCTs) can be counter-intuitively incompatible for computing symmetric convolution, i.e. symmetric convolution can only be computed betw There are a number of advantages to computing symmetric convolutions in DSTs and DCTs in comparison with the more common ...
    4 KB (620 words) - 06:44, 31 January 2023
  • {{redirect|Elastic computing|the physical property|Elasticity (physics)|the economics measurement|Elasti ...Responsive Elastic Computing |date=15 June 2009 |publisher=Association for Computing Machinery |isbn=978-1-60558-578-9|display-authors=etal}}</ref> ...
    10 KB (1,510 words) - 00:49, 13 October 2024
  • {{Short description|Image processing process}} ...Neighboring pixels are combined after thresholding into a ternary pattern. Computing a [[histogram]] of these [[Ternary numeral system|ternary values]] will res ...
    2 KB (263 words) - 08:21, 19 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)