Skip to main content

Research Repository

Advanced Search

Outputs (127)

Block Fusion on Dynamically Adaptive Spacetree Grids for Shallow Water Waves (2014)
Journal Article
Weinzierl, T., Bader, M., Unterweger, K., & Wittmann, R. (2014). Block Fusion on Dynamically Adaptive Spacetree Grids for Shallow Water Waves. Parallel Processing Letters, 24(3), Article 1441006. https://doi.org/10.1142/s0129626414410060

Spacetrees are a popular formalism to describe dynamically adaptive Cartesian grids. Even though they directly yield a mesh, it is often computationally reasonable to embed regular Cartesian blocks into their leaves. This promotes stencils working on... Read More about Block Fusion on Dynamically Adaptive Spacetree Grids for Shallow Water Waves.

Memoryless computation: New results, constructions, and extensions (2014)
Journal Article
Gadouleau, M., & Riis, S. (2015). Memoryless computation: New results, constructions, and extensions. Theoretical Computer Science, 562, 129-145. https://doi.org/10.1016/j.tcs.2014.09.040

In this paper, we are interested in memoryless computation, a modern paradigm to compute functions which generalises the famous XOR swap algorithm to exchange the contents of two variables without using a buffer. In memoryless computation, programs a... Read More about Memoryless computation: New results, constructions, and extensions.

The computational complexity of disconnected cut and 2K2-partition (2014)
Journal Article
Martin, B., & Paulusma, D. (2015). The computational complexity of disconnected cut and 2K2-partition. Journal of Combinatorial Theory, Series B, 111, 17-37. https://doi.org/10.1016/j.jctb.2014.09.002

For a connected graph G=(V,E), a subset U⊆V is called a disconnected cut if U disconnects the graph and the subgraph induced by U is disconnected as well. We show that the problem to test whether a graph has a disconnected cut is NP-complete. This pr... Read More about The computational complexity of disconnected cut and 2K2-partition.

Entropy of Closure Operators and Network Coding Solvability (2014)
Journal Article
Gadouleau, M. (2014). Entropy of Closure Operators and Network Coding Solvability. Entropy, 16(9), 5122-5143. https://doi.org/10.3390/e16095122

The entropy of a closure operator has been recently proposed for the study ofnetwork coding and secret sharing. In this paper, we study closure operators in relation to their entropy. We first introduce four different kinds of rank functions for a gi... Read More about Entropy of Closure Operators and Network Coding Solvability.

Blobs and curves: object-based colocalisation for plant cells (2014)
Journal Article
Nelson, C., Duckney, P., Hawkins, T., Deeks, M., Laissue, P., Hussey, P., & Obara, B. (2014). Blobs and curves: object-based colocalisation for plant cells. Functional Plant Biology, 42(5), 471-485. https://doi.org/10.1071/fp14047

Blobs and curves occur everywhere in plant bioimaging: from signals of fluorescence-labelled proteins, through cytoskeletal structures, nuclei staining and cell extensions such as root hairs. Here we look at the problem of colocalisation of blobs wit... Read More about Blobs and curves: object-based colocalisation for plant cells.

An evaluation of reconstruction filters for a path-searching task in 3D (2014)
Presentation / Conference Contribution
Roberts, D., Ivrissimtzis, I., & Holliman, N. (2014, September). An evaluation of reconstruction filters for a path-searching task in 3D. Presented at 2014 Sixth International Workshop on Quality of Multimedia Experience (QoMEX), Singapore, Singapore

The choice of reconstruction filter used to interpolate between sample points when generating images from volumetric data sets can have an impact on image quality. There are a range of reconstruction filters as well as methods to determine the qualit... Read More about An evaluation of reconstruction filters for a path-searching task in 3D.

Mixing of the Glauber Dynamics for the Ferromagnetic Potts Model (2014)
Journal Article
Bordewich, M., Greenhill, C., & Patel, V. (2016). Mixing of the Glauber Dynamics for the Ferromagnetic Potts Model. Random Structures and Algorithms, 48(1), 21-52. https://doi.org/10.1002/rsa.20569

We present several results on the mixing time of the Glauber dynamics for sampling from the Gibbs distribution in the ferromagnetic Potts model. At a fixed temperature and interaction strength, we study the interplay between the maximum degree (Δ) of... Read More about Mixing of the Glauber Dynamics for the Ferromagnetic Potts Model.

A two-tier index architecture for fast processing large RDF data over distributed memory (2014)
Presentation / Conference Contribution
Cheng, L., Kotoulas, S., Ward, T., & Theodoropoulos, G. (2014, September). A two-tier index architecture for fast processing large RDF data over distributed memory. Presented at 25th ACM conference on Hypertext and social media - HT '14, Santiago, Chile

We propose an efficient method for fast processing large RDF data over distributed memory. Our approach adopts a two-tier index architecture on each computation node: (1) a light-weight primary index, to keep loading times low, and (2) a dynamic, mul... Read More about A two-tier index architecture for fast processing large RDF data over distributed memory.

Improved Depth Recovery In Consumer Depth Cameras via Disparity Space Fusion within Cross-spectral Stereo (2014)
Presentation / Conference Contribution
Payen de La Garanderie, G., & Breckon, T. (2014, September). Improved Depth Recovery In Consumer Depth Cameras via Disparity Space Fusion within Cross-spectral Stereo. Presented at Proceedings of the British Machine Vision Conference

We address the issue of improving depth coverage in consumer depth cameras based on the combined use of cross-spectral stereo and near infra-red structured light sensing. Specifically we show that fusion of disparity over these modalities, within the... Read More about Improved Depth Recovery In Consumer Depth Cameras via Disparity Space Fusion within Cross-spectral Stereo.