Skip to main content

Research Repository

Advanced Search

All Outputs (217)

3D Sketching in Virtual Reality for immersive model search (2018)
Presentation / Conference Contribution
Giunchi, D., James, S., & Steed, A. (2018). 3D Sketching in Virtual Reality for immersive model search. In Expressive '18: Proceedings of the Joint Symposium on Computational Aesthetics and Sketch-Based Interfaces and Modeling and Non-Photorealistic Animation and Rendering (1-12). https://doi.org/10.1145/3229147.3229166

We describe a novel method for searching 3D model collections using free-form sketches within a virtual environment as queries. As opposed to traditional sketch retrieval, our queries are drawn directly onto an example model. Using immersive virtual... Read More about 3D Sketching in Virtual Reality for immersive model search.

On a conjecture of Mohar concerning Kempe equivalence of regular graphs (2018)
Journal Article
Bonamy, M., Bousquet, N., Feghali, C., & Johnson, M. (2019). On a conjecture of Mohar concerning Kempe equivalence of regular graphs. Journal of Combinatorial Theory, Series B, 135, 179-199. https://doi.org/10.1016/j.jctb.2018.08.002

Let G be a graph with a vertex colouring α. Let a and b be two colours. Then a connected component of the subgraph induced by those vertices coloured either a or b is known as a Kempe chain. A colouring of G obtained from α by swapping the colours on... Read More about On a conjecture of Mohar concerning Kempe equivalence of regular graphs.

The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (2018)
Journal Article
Bevern, R., Fluschnik, T., Mertzios, G., Molter, H., Sorge, M., & Suchý, O. (2018). The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Discrete Optimization, 30, 20-50. https://doi.org/10.1016/j.disopt.2018.05.002

This work studies the parameterized complexity of finding secluded solutions to classical combinatorial optimization problems on graphs such as finding minimum - separators, feedback vertex sets, dominating sets, maximum independent sets, and vertex... Read More about The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs.

SSM: Scheduling Security Model for a Cloud Environment (2018)
Presentation / Conference Contribution
Sheikh, A., Munro, M., & Budgen, D. (2018). SSM: Scheduling Security Model for a Cloud Environment. In Proceedings of the 2018 2nd International Conference on Cloud and Big Data Computing (ICCBDC'18) (11-15). https://doi.org/10.1145/3264560.3264568

Scheduling in the cloud is a complex task due to the number and variety of resources available and the volatility of usage-patterns of resources considering that the resource setting is on the service provider. This complexity is compounded further w... Read More about SSM: Scheduling Security Model for a Cloud Environment.

How is Learning Fluctuating? FutureLearn MOOCs Fine-grained Temporal Analysis and Feedback to Teachers and Designers (2018)
Presentation / Conference Contribution
Cristea, A. I., Alamri, A., Kayama, M., Stewart, C., Alshehri, M., & Shi, L. (2018). How is Learning Fluctuating? FutureLearn MOOCs Fine-grained Temporal Analysis and Feedback to Teachers and Designers. In B. Andersson, B. Johansson, S. Carlsson, C. Barry, M. Lang, H. Linger, & C. Schneider (Eds.), Information Systems Development: Designing Digitalization (ISD2018 Proceedings)

Data-intensive analysis of massive open online courses (MOOCs) is popular. Researchers have been proposing various parameters conducive to analysis and prediction of student behaviour and outcomes in MOOCs, as well as different methods to analyse and... Read More about How is Learning Fluctuating? FutureLearn MOOCs Fine-grained Temporal Analysis and Feedback to Teachers and Designers.

Finite Dynamical Systems, Hat Games, and Coding Theory (2018)
Journal Article
Gadouleau, M. (2018). Finite Dynamical Systems, Hat Games, and Coding Theory. SIAM Journal on Discrete Mathematics, 32(3), 1922-1945. https://doi.org/10.1137/15m1044758

The properties of finite dynamical systems (FDSs) have been investigated in the context of coding theoretic problems, such as network coding and index coding, and in the context of hat games, such as the guessing game and Winkler's hat game. In this... Read More about Finite Dynamical Systems, Hat Games, and Coding Theory.

Compressed Dynamic Mesh Sequence for Progressive Streaming (2018)
Journal Article
Yang, B., Jiang, Z., Shangguan, J., Li, F. W., Song, C., Guo, Y., & Xu, M. (2019). Compressed Dynamic Mesh Sequence for Progressive Streaming. Computer Animation and Virtual Worlds, 30(6), Article e1847. https://doi.org/10.1002/cav.1847

Dynamic mesh sequence (DMS) is a simple and accurate representation for precisely recording a 3D animation sequence. Despite its simplicity, this representation is typically large in data size, making storage and transmission expensive. This paper pr... Read More about Compressed Dynamic Mesh Sequence for Progressive Streaming.

Lightweight adaptive E-Advertising Model (2018)
Journal Article
Qaffas, A. A., Cristea, A., & Mead, M. A. (2018). Lightweight adaptive E-Advertising Model. Journal of Universal Computer Science, 24(7), 935-974

Adaptive online advertising is a rapidly expanding marketing tool that delivers personalised messages and adverts to Internet users. At a time when the Internet is burgeoning, many websites use an adaptation process to tailor their advertisements, ho... Read More about Lightweight adaptive E-Advertising Model.

Classification Transfer for Qualitative Reasoning Problems (2018)
Presentation / Conference Contribution
Bodirsky, M., Jonsson, P., Martin, B., & Mottet, A. (2018). Classification Transfer for Qualitative Reasoning Problems. In J. Lang (Ed.), Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI-18) (1256-1262). https://doi.org/10.24963/ijcai.2018/175

We study formalisms for temporal and spatial reasoning in the modern context of Constraint Satisfaction Problems (CSPs). We show how questions on the complexity of their subclasses can be solved using existing results via the powerful use of primitiv... Read More about Classification Transfer for Qualitative Reasoning Problems.

Building and evaluating resources for sentiment analysis in the Greek language (2018)
Journal Article
Tsakalidis, A., Papadopoulos, S., Voskaki, R., Ioannidou, K., Boididou, C., Cristea, A., …Kompatsiaris, Y. (2018). Building and evaluating resources for sentiment analysis in the Greek language. Language Resources and Evaluation, 52(4), 1021-1044. https://doi.org/10.1007/s10579-018-9420-4

Sentiment lexicons and word embeddings constitute well-established sources of information for sentiment analysis in online social media. Although their effectiveness has been demonstrated in state-of-the-art sentiment analysis and related tasks in th... Read More about Building and evaluating resources for sentiment analysis in the Greek language.

Temporal network optimization subject to connectivity constraints (2018)
Journal Article
Mertzios, G., Michail, O., & Spirakis, P. (2019). Temporal network optimization subject to connectivity constraints. Algorithmica, 81(4), 1416-1449. https://doi.org/10.1007/s00453-018-0478-6

In this work we consider temporal networks, i.e. networks defined by a labeling λ assigning to each edge of an underlying graph G a set of discrete time-labels. The labels of an edge, which are natural numbers, indicate the discrete time moments at w... Read More about Temporal network optimization subject to connectivity constraints.

Scalable Remote Rendering using Synthesized Image Quality Assessment (2018)
Journal Article
Wang, X., Liang, X., Yang, B., & Li, F. W. (2018). Scalable Remote Rendering using Synthesized Image Quality Assessment. IEEE Access, 6, 36595-36610. https://doi.org/10.1109/access.2018.2853132

Depth-image-based rendering (DIBR) is widely used to support 3D interactive graphics on low-end mobile devices. Although it reduces the rendering cost on a mobile device, it essentially turns such a cost into depth image transmission cost or bandwidt... Read More about Scalable Remote Rendering using Synthesized Image Quality Assessment.

Temporal vertex cover with a sliding time window (2018)
Presentation / Conference Contribution
Akrida, E., Mertzios, G., Spirakis, P., & Zamaraev, V. (2018). Temporal vertex cover with a sliding time window. In I. Chatzigiannakis, C. Kaklamanis, D. Marx, & D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) : Prague, Czech Republic, July 9-13, 2018 ; proceedings (148:1-148:14). https://doi.org/10.4230/lipics.icalp.2018.148

Modern, inherently dynamic systems are usually characterized by a network structure, i.e. an underlying graph topology, which is subject to discrete changes over time. Given a static underlying graph G, a temporal graph can be represented via an assi... Read More about Temporal vertex cover with a sliding time window.