Search results

...9784-7 |issn=1433-0490}}</ref> and was named after [[Catalysis|catalysts]] in chemistry, based on the metaphorically viewing the full memory as a "cataly ...

...Theory. 2018.</ref> when studying [[Upper and lower bounds|lower bounds]] in computer science named after [[Rasmus Pagh]]. ...amic problems." Proceedings of the forty-second ACM symposium on Theory of computing. 2010.</ref> ...

...th>x_T := (x_s)_{s\in S}</math> such that <math>x_s = 1</math> if <math>s \in T</math> and <math>x_s = 0</math> if <math>s \notin T.</math> ...x_T = (x_1,x_2,\ldots,x_n)</math> where <math>x_i = 1</math> if <math>s_i \in T</math> and <math>x_i = 0</math> if <math>s_i \notin T.</math> ...

...ww.cse.iitk.ac.in/users/manindra/algebra/primality_v6.pdf |title=PRIMES is in P |journal=[[Annals of Mathematics]] |volume=160 |year=2004 |issue=2 |pages ...ive-url=https://web.archive.org/web/20180425032115/https://www.cse.iitk.ac.in/users/nitin/talks/Dec2014-3Paris.pdf|archive-date=25 April 2018|url-status= ...

...ame being a reference to "{{lang|de|Rechenplan}}" (i.e. computation plan), in [[Konrad Zuse]]'s terminology designating a single {{lang|de|[[Plankalkül]] ...n}} (i.e. ''Automatically created Computation Plans for Program-Controlled Computing Machines'').<ref name="Rutishauser_1951"/> ...

...lyn M.|date=April 3, 2014|work=The Wall Street Journal|accessdate=June 10, 2014}}</ref> It compares both required time and [[Data compression ratio|compres ...tio in most cases."<ref>{{Cite web |title=Lossless compression with Brotli in Rust for a bit of Pied Piper on the backend |url=https://dropbox.tech/infra ...

{{Short description|Unsolved problem in parallel algorithms}} In the theory of parallel algorithms, the '''1-vs-2 cycles problem''' concerns ...

{{Short description|Italian professor of quantum computing (born 1972)}} | caption = Morello in 2019 ...

...ory]]. It was funded in 2012 by [[Microsoft Research]] and first issued in 2014. * [[Sophie Morel]] (2014), for her research in [[number theory]], particularly her contributions to the [[Langlands progra ...

{{Short description|BOINC Account Manager for volunteer computing projects}} | industry = [[Volunteer computing]] ...

...for his work on [[graph algorithm]]s and [[parameterized complexity]] and in particular for algorithms relating to [[tree decomposition]] of graphs. ...under the supervision of [[Jan van Leeuwen]] with the thesis ''Distributed Computing – Structure and Complexity.''<ref name="cv"/><ref>{{mathgenealogy|id=83356| ...

...|filter]] for feature-preserving [[image noise|noise]] removal, consisting in a smoothing filter that only involves pixels satisfying some validity crite ...iteria are:<ref name="sonka2014image">{{Harvsp|M. Sonka|V. Hlavac|R. Boyle|2014|p=128|ref=sonka2014image}}</ref> ...

{{short description|Quantum computing algorithm}} ...t |first1=Stephen D. |title=Powered by magic |journal=Nature |date=11 June 2014 |volume=510 |issue=7505 |pages=345–347 |doi=10.1038/nature13504|pmid=249191 ...

{{short description|Distributed computing model}} ...sed on their previous state, and the result of the computation can be read in the states of the agents once the computation has [[convergence (mathematic ...

...Cite web|date=2014-03-10|title=iInside retail brochure: Leading the market in indoor location techno…|url=http://www.slideshare.net/KelliePeterson/iinsid ...he work can be accelerated greatly e.g. by renting a large amount of cloud computing resources temporarily. ...

...Role-based access control|role-based]] security within an institution, and in [[batch processing|batch]] mode for [[Import and export of data|exporting d ...the data to other databases or by looking at unique characteristics found in the [[field (computer science)|field]]s and [[row (database)|records]] of t ...

{{Short description|Unsolved problem in theoretical computer science}} In [[theoretical computer science]], the '''log-rank conjecture''' states that ...

...Fourier matrices satisfy the RIP with number of measurements nearly linear in the sparsity level.<ref>F. Yang, S. Wang, and C. Deng, "''Compressive sensi ...;''p'' be an integer. Suppose that there exists a constant <math>\delta_s \in (0,1)</math> such that, for every ''m''&nbsp;&times;&nbsp;''s'' submatrix ' ...

{{Multiple issues|{{primary sources|date=May 2014}}{{technical|date=May 2014}} ...o large to fit in a [[cache (computing)|cache]] where operations are done. In the [[external memory model]], the number of memory transfers it needs to p ...

In [[quantum information]], the '''''gnu'' code''' refers to a particular fami ...ant quantum codes | journal=Physical Review A | volume=90 | issue=6 | date=2014-12-10 | issn=1050-2947 | doi=10.1103/physreva.90.062317 | page=062317| arxi ...