Computer Science: Recent submissions

Now showing items 41-45 of 297

    • Computing normalisers of highly intransitive groups 

      Chang, Mun See (University of St Andrews, 2021-06-30) - Thesis
      We investigate the normaliser problem, that is, given 𝐺, 𝐻 ≤ 𝑆ₙ, compute 𝑁[sub]𝐺(𝐻). The fastest known theoretical algorithm for this problem is simply exponential, but more efficient algorithms are known for some ...

    • Hidden Markov models with variational inference in marketing science 

      Danielson, Matthew (University of St Andrews, 2021-06-30) - Thesis
      Hidden Markov Models (HMMs) are a well known type of model for many varieties of sequen- tial data. There exist several algorithms for learning HMMs: a variant of an expectation- maximization (EM) algorithm known as the ...

    • A grey-box approach to benchmarking and performance modelling of data-intensive applications 

      Ceesay, Sheriffo (University of St Andrews, 2021-06-30) - Thesis
      The advent of big data about a decade ago, coupled with its processing and storage challenges gave rise to the development of a multitude of data-intensive frameworks. These distributed parallel processing frameworks can ...

    • Computer assisted data acquisition in real time 

      Harland, David M. (University of St Andrews, 1978) - Thesis
      A technique is outlined by which a normal time-shared operating system may be modified to permit concurrent processing of the time-synchronous data sampling operations in real time and the more typical time-insensitive ...

    • Implementation of a macro-processor for string handling 

      Stathopoulos, Constantin Nicholas (University of St Andrews, 1971) - Thesis
      In this work TRAC is implemented in FOTRAN IV. This will enable various users to compile this FORTRAN version and use it in their own installations making only minor modifications to meet individual specifications. The ...