Search results

...tson University]] in 1962,{{r|green}} and completed a Ph.D. in mathematics in 1969 at [[Arizona State University]]. Her dissertation, ''Some Results on < ...ormation science.{{r|green}} She came to the University of Hawaiʻi at Hilo in 1990,{{r|regents}} and chaired the computer science department there for ma ...

In [[linear algebra]], a '''convergent matrix''' is a matrix that converges to ...t matrix '''T'''. A semi-convergent splitting of a matrix '''A''' results in a semi-convergent matrix '''T'''. A general [[iterative method]] converges ...

*[[Ida Corr]] (born 1977), Danish musician ==Places in Ireland== ...

...of Operational Research | volume = 1 | issue = 6 | pages = 396–402| year = 1977 }}</ref> In matrix notation: ...

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

...topic is notable separately from [[Klee's measure problem]], which puts it in relevant context. [[User:Felix QW|Felix QW]] ([[User talk:Felix QW|talk]]) Framed as an open research problem published in 1977 in ''The American Mathematical Monthly'',<ref>{{cite journal ...

{{Short description|Class of numerical methods in scientific computing}} ...le methods''' is a widely used class of numerical algorithms in scientific computing. Its application ranges from [[computational fluid dynamics]] (CFD) over [[ ...

...Differential invariants were introduced in special cases by [[Sophus Lie]] in the early 1880s and studied by [[Georges Henri Halphen]] at the same time. ...n act on the higher-order derivatives in a nontrivial manner that requires computing the ''prolongation'' of the group action. The action of ''G'' on the first ...

In [[algebraic topology]], a branch of [[mathematics]], the '''Čech-to-derived ...ompute the cohomology of line bundles on projective space.{{sfn|Hartshorne|1977|loc=Theorem III.5.1}} ...

|date = March 1977 |doi = 10.1109/TSE.1977.229904 ...

'''Magnussen model''' is a popular method for computing reaction rates as a function of both mean concentrations and [[turbulence]] |year=1977 ...

In [[graph theory]], a branch of mathematics, '''graph canonization''' is the | series = Lecture Notes in Comput. Sci. ...

...oi diagram]], and coincides with the Voronoi diagram of the circle centers in the case that all the circles have equal radii.<ref>{{citation | journal = [[SIAM Journal on Computing]] ...

...Maryland, College Park]] department of computer science whose research is in [[computational geometry]]. ...]] in 1977 and received his Ph.D. in Computer Science at Purdue University in 1983 under the advisement of Christoph Hoffmann. ...

...e pair (''x'', ''y'') is then called a ''claw''. Some problems, especially in cryptography, are best solved when viewed as a claw finding problem, hence ...A \to C</math>, <math>g: B \to C</math> two functions. A pair <math>(x,y) \in A \times B</math> is called a ''claw'' if <math>f(x) = g(y)</math>. The cla ...

...ved that NP is unequal to [[co-NP]] (the class of complements of languages in NP), which would imply more strongly that the complements of all [[NP-compl ...creativity and the {{nowrap|<math>k</math>-creative}} sets were introduced in 1985 by [[Deborah Joseph]] and Paul Young, following earlier attempts to de ...

In [[statistics]], '''ridit scoring''' is a statistical method used to analyze ...<u>''ridit''</u> describes how the distribution of the dependent variable in row ''i'' of a contingency table compares <u>''r''</u>elative to an <u>''i' ...

...tern]] 231; they are counted by the [[Catalan number]]s, and may be placed in [[bijection]] with many other combinatorial objects with the same counting ...sorted: the three elements are all pushed onto the stack, and then popped in the order 1,2,3. However, the sequence 2,3,1 is not correctly sorted: the a ...

...mal binary search tree]]s and [[Huffman coding|alphabetic Huffman codes]], in [[linearithmic]] time. It is named after [[Adriano Garsia]] and [[Michelle ...h a tree has exactly <math>n+1</math> leaf nodes, which can be identified (in the order given by the binary tree) with the <math>n+1</math> input weights ...

...le pieces have well-defined [[Multiplicity (mathematics)|multiplicities]]. In particular, a representation of a finite group over a [[field (mathematics) ...W\oplus U</math>.{{sfn|Fulton|Harris|1991|loc=Proposition 1.5}}{{sfn|Serre|1977|loc=Theorem 1}}}} ...