Search results
Results from the WOW.Com Content Network
M. C. Chakrabarti, On the C-matrix in design of experiments, J. Indian Statist. Assoc. 1 (1963), 8-23. On the use of incidence matrices of designs in sampling from finite populations, MC Chakrabarti – Journal of Indian Statistical Association, 1963
Ranajit Chakraborty (April 17, 1946 – September 23, 2018) was a human and population geneticist. [1] At the time of his death, he was Director of the Center for Computational Genomics at the Institute of Applied Genetics and Professor in the Department of Forensic and Investigative Genetics at the University of North Texas Health Science Center in Fort Worth, Texas. [1]
There are other estimation techniques other than min/max sketches. The first paper on count-distinct estimation [ 7 ] describes the Flajolet–Martin algorithm , a bit pattern sketch. In this case, the elements are hashed into a bit vector and the sketch holds the logical OR of all hashed values.
The Yarrow algorithm is a family of cryptographic pseudorandom number generators (CSPRNG) devised by John Kelsey, Bruce Schneier, and Niels Ferguson and published in 1999. . The Yarrow algorithm is explicitly unpatented, royalty-free, and open source; no license is required to use
Atulya K. Nagar is a mathematical physicist, academic and author. He holds the Foundation Chair as Professor of Mathematics and is the Pro-Vice-Chancellor for Research at Liverpool Hope University.
Vivek Shripad Borkar (born 1954) is an Indian electrical engineer, mathematician and an Institute chair professor at the Indian Institute of Technology, Mumbai. [1] He is known for introducing analytical paradigm in stochastic optimal control processes [2] and is an elected fellow of all the three major Indian science academies viz. the Indian Academy of Sciences, [3] Indian National Science ...
Other areas he worked in include multivariate analysis, estimation theory, and differential geometry. His other contributions include the Fisher–Rao theorem, Rao distance, and orthogonal arrays. He was the author of 15 books [12] and authored over 400 journal publications.
Round robin is a procedure for fair item allocation.It can be used to allocate several indivisible items among several people, such that the allocation is "almost" envy-free: each agent believes that the bundle they received is at least as good as the bundle of any other agent, when at most one item is removed from the other bundle.