Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...ontext of localization, the '''graph realization problem''' may also refer to finding a set of positions <math>(x_1,\dots,x_n)</math> in some Euclidean s ...has an [[adjacency matrix]] where the column sums and row sums correspond to <math>(d_1,\ldots,d_n)</math>. The problem is then sometimes denoted by ''s ...
    4 KB (588 words) - 01:41, 22 February 2025
  • ...r search tools based on the [[hash table]] functionality only. In contrast to [[skip list]]s and other [[tree (data structure)|tree data structures]], th ...it, search it, and detect and repair errors in a skip graph introduced due to node failures.}}</ref> ...
    11 KB (1,841 words) - 17:27, 4 July 2022
  • ...er miners to generate a block. The solution to this problem was for miners to pool their resources so they could generate blocks more quickly and therefo * '''2011–2013: ''' The era of [[deepbit]], which at its peak held up to 45% of the network [[hashrate]].{{cn|date=February 2021}} ...
    14 KB (2,244 words) - 07:18, 7 January 2025
  • ...es. More formally, It assigns a coordinate embedding <math>\vec c_n</math> to each node <math>n</math> in a network using an [[Mathematical optimization| In general, Network Coordinate Systems can be used for peer discovery, optimal-server selection, and characteristic-aware routing. ...
    19 KB (2,693 words) - 12:59, 5 October 2024
  • ...d anything original to mathematics. The proof is nontrivial and, according to the historian of mathematics [[William Dunham (mathematician)|William Dunha [[File:Garfield Proof.png|thumb|right|250px|Diagram to explain Garfield's proof of the Pythagorean theorem]] ...
    5 KB (669 words) - 16:09, 25 January 2025
  • ...Artificial Intelligence |url=https://www.quantamagazine.org/a-new-approach-to-computation-reimagines-artificial-intelligence-20230413/?mc_cid=ad9a93c472& ...jana |date=2021-10-05 |title=A Theoretical Perspective on Hyperdimensional Computing |url=https://redwood.berkeley.edu/wp-content/uploads/2021/08/Thomas2021.pdf ...
    14 KB (1,900 words) - 18:45, 16 February 2025
  • ...978-0-8493-8076-1}}</ref> The model applies the [[leaky bucket algorithm]] to a stochastic source. ...1958Natur.182...39G| s2cid = 42193342 }}</ref> Fluid queues allow arrivals to be continuous rather than discrete, as in models like the [[M/M/1 queue|M/M ...
    23 KB (3,067 words) - 20:40, 22 November 2023
  • ...retical results are not reliable. This is independent of the media and the peer-review and the person, who published it. The main idea behind BOC modulation is to reduce the interference with [[BPSK]]-modulated signals, which have a [[sin ...
    6 KB (939 words) - 02:54, 13 December 2024
  • ...on information, a set including the satisfying solution would be sent back to the user.<ref name=":1" /> General privacy requirements include [[K-anonymi ...ntify a user.<ref name=":5" /> Thus, multiple solutions have been proposed to preserve and enhance users’ privacy when using location-based services. Amo ...
    55 KB (7,739 words) - 07:36, 21 December 2024
  • ...edirect.com/science/article/pii/S0925772108001193 Efficient algorithms for computing Reeb graphs], Computational Geometry 42 (2009) 606–616</ref> ...Acad. Sci. Paris 222 (1946) 847–849</ref> Reeb graphs are the natural tool to study multivalued functional relationships between 2D scalar fields <math>\ ...
    13 KB (1,918 words) - 15:06, 1 March 2025
  • ..., [[Electronic design automation]], [[Artificial intelligence]], [[Quantum computing]] ...raine in Crisis and Beyond|date=March 30, 2022}}</ref> responsible for aid to [[Ukraine]] worth over a hundred million dollars.<ref> ...
    29 KB (3,672 words) - 12:55, 31 December 2024
  • {{Short description|File system that allows many clients to have access}} ...ical tree]], where the nodes represent directories. There are several ways to share files in a distributed architecture: each solution must be suitable f ...
    62 KB (8,494 words) - 09:35, 29 October 2024
  • ...es. The last class is of special interest since these functions correspond to system analysis by means of external [[feedback]] (feedback control). ...nning of the 21st century, with 300-400 papers per year being published in peer-reviewed journals. The method proposed in <ref name="OGY"/> is now called t ...
    22 KB (3,200 words) - 02:18, 5 December 2024
  • ...drology-and-remote-sensing-applications.html|title=Univ of Idaho submitted to: Producing and Integrating Time Series of Gridded Evapotranspiration for Ir ...f name="arspub"/> The overall concept of backward averaging was introduced to expedite the convergence process of iteratively solved surface energy balan ...
    43 KB (5,770 words) - 23:24, 24 August 2024
  • ...processor|streaming multiprocessor]]s.{{Sfn|Elster|Haugdahl|2022|p=4}} Due to the increased memory bandwidth provided by the SXM5 socket, the Nvidia Hopp ...s may be used, avoiding registers and SM instructions while enabling users to write warp specialized codes. TMA is exposed through <code>cuda::memcpy_asy ...
    18 KB (2,318 words) - 22:45, 28 January 2025
  • ...} / \text{time}</math>). It's an important parameter for the time it takes to print, and can affect the quality of the print. ...ps://zortrax.com/blog/resin-3d-printing-faster-and-more-precise/|title=How to Make Resin 3D Printing 8x Faster and 9x More Precise|date=2018-09-21|websit ...
    17 KB (2,510 words) - 15:55, 7 February 2025
  • ...="Gustafsson 2007"/> Microscale and macroscale models can be used together to understand different aspects of the same problem. ...detailed microscale models. Connections between the two scales are related to [[multiscale modeling]]. One mathematical technique for multiscale modeling ...
    22 KB (2,994 words) - 19:10, 25 June 2024
  • The majority of projects define extensions to the [[IEEE 802.1Q]]{{snd}} Bridges and Bridged Networks, which describes [[ ...e too small or the bandwidth is insufficient, but excessive buffering adds to the delay, which is unacceptable when low deterministic delays are required ...
    60 KB (8,598 words) - 20:49, 10 February 2025
  • ...ese points are still considered to be vertices, rather than being interior to edges.{{r|precise}} ...cted in [[polynomial time]]. One way of constructing a polygonalization is to choose any point <math>q</math> in the [[convex hull]] of <math>P</math> (n ...
    26 KB (3,389 words) - 14:46, 29 July 2024
  • ...n's algorithm]], devised by [[Volker Strassen]] in 1969 and often referred to as "fast matrix multiplication".<ref name="strassen69"> ...to multiply two square {{math|''n'' × ''n''}} matrices [[big O notation|up to constant factors]] is still unknown. This is a major open question in [[the ...
    35 KB (4,754 words) - 05:21, 18 February 2025
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)