Search results

In mathematics, a '''sum of radicals''' is defined as a finite [[linear combin ...]], since the computation of the [[Euclidean distance]] between two points in the general case involves the computation of a [[square root]], and therefo ...

...Stanley decomposition''' is a way of writing a [[ring (mathematics)|ring]] in terms of polynomial subrings. They were introduced by {{harvs|txt|last=Stan |title=Computing combinatorial decompositions of rings ...

...a '''loss network''' is a [[stochastic model]] of a [[telephony network]] in which calls are routed around a network between nodes. The links between no ...als of Applied Probability | volume = 1 | issue = 3 | pages = 319 | year = 1991 | jstor=2959742| doi-access = free }}</ref> where he demonstrated the behav ...

...'''Rees decomposition''' is a way of writing a [[ring (mathematics)|ring]] in terms of polynomial subrings. They were introduced by {{harvs|txt|last=Rees |title=Computing combinatorial decompositions of rings ...

...vex bodies]], a problem that can also be used to model many other problems in [[combinatorial enumeration]]. Often these works use a black box model of computation in which the input is given by a subroutine for testing whether a point is ins ...

...'''er '''S'''econd) is a measure of a neuronal network performance, useful in fields of [[neuroscience]], [[cognitive science]], [[artificial intelligenc ==Computing== ...

...EE Transactions on Neural Networks |volume=2 |issue=6 |pages=568–576 |date=1991-11-01 |doi=10.1109/72.97934 |pmid=18282872 |last1=Specht |first1=D. F. |tit GRNN represents an improved technique in the neural networks based on the [[nonparametric regression]]. The idea is ...

...rious sizes in a graph. It is one of several [[graph polynomial]]s studied in [[algebraic graph theory]]. ...''H''_''n''(''x'') is the "probabilist's Hermite polynomial" (1) in the definition of [[Hermite polynomial]]s. These facts were observed by {{ ...

In the [[mathematics|mathematical]] area of [[graph theory]], a graph is '''ev ...s. {{harvtxt|Chudnovsky|Kawarabayashi|Seymour|2004}} estimate that it runs in "time about <math>{\mathcal O}(n^{40})</math>."</ref> ...

{{Draft topics|computing|mathematics}} ...n|QKD(Quantum Key Distribution Protocol)]] developed by [[Artur Ekert]] in 1991. ...

...bb Z_2</math>-graded commutative algebras ([[supercommutative algebra]]s). In particular, superconnections are defined as [[Koszul connection]]s on these ...dle)|principal connection]]s. Principal graded bundles also are considered in the category of [[graded manifold]]s. ...

In [[graph theory]], a '''nonblocker''' is a subset of vertices in an [[undirected graph]], all of which are adjacent to vertices outside of t ...nonblocker in a graph was formulated by {{harvtxt|Papadimitriou|Yannakakis|1991}}, who observed that it belongs to [[SNP (complexity)#MaxSNP|MaxSNP]].{{r|p ...

...ion|The polynomial hierarchy is contained in probabilistic Turing machine in polynomial time}} ...rchy|url=http://epubs.siam.org/doi/10.1137/0220053|journal=SIAM Journal on Computing|volume=20|issue=5|pages=865–877|doi=10.1137/0220053|issn=0097-5397|citeseer ...

In mathematics, a '''sparse polynomial''' (also '''lacunary polynomial'''{{r|r ...l}} Sparse polynomials have also been used in pure mathematics, especially in the study of [[Galois group]]s, because it has been easier to determine the ...

...but typically somewhat<ref name="Chandrasekaran" /> cheaper to compute and in particular much cheaper and easier to update when the original matrix is sl ...ver, if a row/column is added or removed, its decomposition can be updated in <math>O(mn)</math> operations.<ref name="golub-van-loan" /> ...

...r his work on matching geometric shapes, including methods for efficiently computing the [[Fréchet distance]] between shapes. He was also the first to use the G ...[[Kurt Mehlhorn]] at [[Saarland University]], where he completed his Ph.D. in 1976 on algorithms for parsing [[context-free language]]s.{{r|mg}} ...

In [[graph theory]], a '''folded cube graph''' is an [[undirected graph]] form ...of vertices in a hypercube graph of dimension ''k''&nbsp;&minus;&nbsp;1. (In a hypercube with 2^''n'' vertices, a pair of vertices are ''oppos ...

'''Michelle Lynn Wachs''' is an American mathematician who specializes in [[algebraic combinatorics]] and works as a professor of mathematics at the ...achs algorithm]] for [[optimal binary search tree]]s, which they published in 1977.{{r|knuth}}{{ran|A}} ...

...sign, [[data-mining]], [[finite elements]] and communication in [[parallel computing]]. ...o the edges {{math|''w'': ''E'' &rarr; ''N''}} and an [[integer]] <math>k \in \{2,3, \ldots, |V|\},</math> [[Partition (mathematics)|partition]] {{mvar|V ...

{{redirect|RPZA|reduced pressure zone assemblies in water supply|Reduced pressure zone device}} ...v=ujaCrbiAyB0&t=1599s|publisher=Computer History Museum}}</ref>) When used in the [[Audio Video Interleave|AVI]] [[Digital container format|container]], ...