Computer Science (School of)
All of our academic staff are research active, working with a team of post-graduate and post-doctoral researchers and a lively population of research students. Our research focuses on core themes of theoretical and practical computer science: artificial intelligence and symbolic computation, networked and distributed systems, systems engineering, and human computer interaction.
For more information please visit the School of Computer science home page.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Sub-communities within this community
Recent Submissions
-
Mobility multihoming duality for the Internet Protocol
(2022-06-21) - ThesisIn the current Internet, mobile devices with multiple connectivity are becoming increasingly common; however, the Internet protocol itself has not evolved accordingly. Instead, add-on mechanisms have emerged, but they do ... -
Visual analysis of arguments in video-based debates
(2022-06-15) - ThesisThe ability to understand, process and evaluate arguments made by others and ourselves is important in many personal and professional spheres, such as political debates. However, developing an understanding and communicating ... -
Single-handed interaction techniques for mobile and wearable computing
(University of St Andrews, 2021-06-30) - ThesisThe past decade has seen the proliferation of mobile and wearable computing devices into our everyday life. Such devices are now used throughout the day for both productivity and entertainment purposes. As a result, it ... -
Computing normalisers of highly intransitive groups
(University of St Andrews, 2021-06-30) - ThesisWe 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
(University of St Andrews, 2021-06-30) - ThesisHidden 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 ...
RSS 1.0