Skip to main content

Research Repository

Advanced Search

All Outputs (133)

Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes (2016)
Journal Article
Kuo, C., & Stewart, I. (2016). Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes. Theoretical Computer Science, 627, 102-106. https://doi.org/10.1016/j.tcs.2016.02.029

Let F v and Fe be sets of faulty vertices and faulty edges, respectively, in the folded hypercube FQn so that |F v | + |Fe | ≤ n − 2, for n ≥ 2. Choose any fault-free edge e. If n ≥ 3 then there is a fault-free cycle of length l in FQn containing e,... Read More about Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes.

What Do We Know and How Well Do We Know It? Current Knowledge about Software Engineering Practices (2016)
Presentation / Conference Contribution
Budgen, D. (2016). What Do We Know and How Well Do We Know It? Current Knowledge about Software Engineering Practices. In P. Lorenz, J. Cardoso, L. A. Maciaszek, & M. van Sinderen (Eds.), Software Technologies : 10th International Joint Conference, ICSOFT 2015, Colmar, France, July 20-22, 2015. Revised selected papers (3-16). https://doi.org/10.1007/978-3-319-30142-6_1

Context: The ‘prescriptions’ used in software engineering for developing and maintaining systems make use of a set of ‘practice models’, which have largely been derived by codifying successful experiences of expert practitioners. Aim: To review the w... Read More about What Do We Know and How Well Do We Know It? Current Knowledge about Software Engineering Practices.

Filling the complexity gaps for colouring planar and bounded degree graphs (2016)
Presentation / Conference Contribution
Dabrowski, K. K., Dross, F., Johnson, M., & Paulusma, D. (2015, October). Filling the complexity gaps for colouring planar and bounded degree graphs. Presented at 26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Verona, Italy

We consider a natural restriction of the List Colouring problem, k-Regular List Colouring, which corresponds to the List Colouring problem where every list has size exactly k. We give a complete classification of the complexity of k-Regular List Colo... Read More about Filling the complexity gaps for colouring planar and bounded degree graphs.

Intersection Graphs of L-Shapes and Segments in the Plane (2016)
Journal Article
Felsner, S., Knauer, K., Mertzios, G., & Ueckerdt, T. (2016). Intersection Graphs of L-Shapes and Segments in the Plane. Discrete Applied Mathematics, 206, 48-55. https://doi.org/10.1016/j.dam.2016.01.028

An L-shape is the union of a horizontal and a vertical segment with a common endpoint. These come in four rotations: Full-size image (25 K), Full-size image (25 K),Full-size image (25 K) and Full-size image (25 K). A k-bend path is a simple path in t... Read More about Intersection Graphs of L-Shapes and Segments in the Plane.

A 3D Steganalytic Algorithm and Steganalysis-Resistant Watermarking (2016)
Journal Article
Yang, Y., Pintus, R., Rushmeier, H., & Ivrissimtzis, I. (2017). A 3D Steganalytic Algorithm and Steganalysis-Resistant Watermarking. IEEE Transactions on Visualization and Computer Graphics, 23(2), 1002-2626. https://doi.org/10.1109/tvcg.2016.2525771

We propose a simple yet efficient steganalytic algorithm for watermarks embedded by two state-of-the-art 3D watermarking algorithms by Cho et al. The main observation is that while in a clean model the means/variances of Cho et al.’s normalized histo... Read More about A 3D Steganalytic Algorithm and Steganalysis-Resistant Watermarking.

On using Feature Descriptors as Visual Words for Object Detection within X-ray Baggage Security Screening (2016)
Presentation / Conference Contribution
Kundegorski, M., Akcay, S., Devereux, M., Mouton, A., & Breckon, T. (2016). On using Feature Descriptors as Visual Words for Object Detection within X-ray Baggage Security Screening. In Proc. Int. Conf. on Imaging for Crime Detection and Prevention (12 (6 .)-12 (6 .)(1)). https://doi.org/10.1049/ic.2016.0080

Here we explore the use of various feature point descriptors as visual word variants within a Bag-of-Visual-Words (BoVW) representation scheme for image classification based threat detection within baggage security X-ray imagery. Using a classical Bo... Read More about On using Feature Descriptors as Visual Words for Object Detection within X-ray Baggage Security Screening.

Quality measures of reconstruction filters for stereoscopic volume rendering (2016)
Journal Article
Roberts, D. A., & Ivrissimtzis, I. (2016). Quality measures of reconstruction filters for stereoscopic volume rendering. Computational Visual Media, 2(1), 19-30. https://doi.org/10.1007/s41095-016-0035-7

In direct volume rendering (DVR), the choice of reconstruction filter can have a significant effect on the visual appearance of the images produced and thus, on the perceived quality of a DVR rendered scene. This paper presents the results of a subje... Read More about Quality measures of reconstruction filters for stereoscopic volume rendering.

3D Mesh Compression and Transmission for Mobile Robotic Applications (2016)
Journal Article
Yang, B., Wang, X., Li, F. W., Xie, B., Liang, X., & Jiang, Z. (2016). 3D Mesh Compression and Transmission for Mobile Robotic Applications. International Journal of Advanced Robotic Systems, 13, Article 9. https://doi.org/10.5772/62035

Mobile robots are useful for environment exploration and rescue operations. In such applications, it is crucial to accurately analyse and represent an environment, providing appropriate inputs for motion planning in order to support robot navigation... Read More about 3D Mesh Compression and Transmission for Mobile Robotic Applications.

Discriminative Semantic Subspace Analysis for Relevance Feedback (2016)
Journal Article
Zhang, L., Shum, H., & Shao, L. (2016). Discriminative Semantic Subspace Analysis for Relevance Feedback. IEEE Transactions on Image Processing, 25(3), 1275-1287. https://doi.org/10.1109/tip.2016.2516947

Content-based image retrieval (CBIR) has attracted much attention during the past decades for its potential practical applications to image database management. A variety of relevance feedback (RF) schemes have been designed to bridge the gap between... Read More about Discriminative Semantic Subspace Analysis for Relevance Feedback.

On temporally connected graphs of small cost (2016)
Presentation / Conference Contribution
Akrida, E., Gasieniec, L., Mertzios, G., & Spirakis, P. (2015, September). On temporally connected graphs of small cost. Presented at 13th Workshop on Approximation and Online Algorithms (WAOA), Patras, Greece

We study the design of small cost temporally connected graphs, under various constraints. We mainly consider undirected graphs of n vertices, where each edge has an associated set of discrete availability instances (labels). A journey from vertex u t... Read More about On temporally connected graphs of small cost.

Two Particle-in-Grid Realisations on Spacetrees (2016)
Journal Article
Weinzierl, T., Verleye, B., Henri, P., & Roose, D. (2016). Two Particle-in-Grid Realisations on Spacetrees. Parallel Computing: Systems & Applications, 52, 42-64. https://doi.org/10.1016/j.parco.2015.12.007

The present paper studies two particle management strategies for dynamically adaptive Cartesian grids at hands of a particle-in-cell code. One holds the particles within the grid cells, the other within the grid vertices. The fundamental challenge fo... Read More about Two Particle-in-Grid Realisations on Spacetrees.

Towards detection of influential sentences affecting reputation in Wikipedia (2016)
Presentation / Conference Contribution
Zhou, Y., & Cristea, A. (2016). Towards detection of influential sentences affecting reputation in Wikipedia. In W. Nejdl (Ed.), WebSci '16 : Proceedings of the 8th ACM Conference on Web Science (244-248). https://doi.org/10.1145/2908131.2908177

Wikipedia has become the most frequently viewed online encyclopaedia website. Some sentences in Wikipedia articles have direct and obvious impact on people's opinions towards the mentioned named entities. This paper defines and tackles the problem of... Read More about Towards detection of influential sentences affecting reputation in Wikipedia.

Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins (2016)
Presentation / Conference Contribution
Berenbrink, P., Friedetzky, T., Kling, P., Mallmann-Trenn, F., Nagel, L., & Wastell, C. (2016). Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (83-92). https://doi.org/10.1145/2933057.2933092

A fundamental problem in distributed computing is the distribution of requests to a set of uniform servers without a centralized controller. Classically, such problems are modelled as static balls into bins processes, where m balls (tasks) are to be... Read More about Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins.