• An examination of fast similarity search trees with gating 

    Wiesman, Seth J. (University of Missouri--Columbia, 2016)
    The emergence of complex data objects that must be indexed and queried in databases has created a need for access methods that are both generic and efficient. Traditional search algorithms that only check specified fields ...
  • Extending and applying properties of the uc generalized matrix inverse 

    Zhang, Bo (University of Missouri--Columbia, 2018)
    The recent development of a generalized matrix inverse which preserves the units of state variables is very important for many areas of science and technology. In this thesis we derive new mathematical results for this ...
  • Fast inpainting algorithm for real-time video inpainting problem 

    Chen, Muxi (University of Missouri--Columbia, 2016)
    The paper examines a simple and efficient method to solve the digital inpainting problem with a reasonable result by processing the information locally around the painting area. The method is based on a unique matrix ...
  • Permutation compression with applications to genomic data 

    Vatsa, Shobha (University of Missouri--Columbia, 2018)
    [ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI AT AUTHOR'S REQUEST.] High Sequencing Technology generates data at an increasing rate. The technology is used widely in molecular biology. Technologies similar to this are ...