Outputs (3167)

Random walks which prefer unvisited edges: exploring high girth even degree expanders in linear time (2012)
Presentation / Conference Contribution
Berenbrink, P., Cooper, C., & Friedetzky, T. (2012, December). Random walks which prefer unvisited edges: exploring high girth even degree expanders in linear time. Presented at ACM Symposium on Principles of Distributed Computing - PODC '12, Madeira, Portugal

Correlating Histology and Spectroscopy to Differentiate Pathologies of the Colon (2012)
Presentation / Conference Contribution
Carey, D., Shepherd, N., Kendall, C., Stone, N., Breckon, T., & Lloyd, G. (2012, July). Correlating Histology and Spectroscopy to Differentiate Pathologies of the Colon. Presented at Proc. Conference on Medical Image Understanding and Analysis

On Cross-Spectral Stereo Matching using Dense Gradient Features (2012)
Presentation / Conference Contribution
Pinggera, P., Breckon, T., & Bischof, H. (2012, September). On Cross-Spectral Stereo Matching using Dense Gradient Features. Presented at Proc. British Machine Vision Conference

Consistency in Muti-modal Automated Target Detection using Temporally Filtered Reporting (2012)
Presentation / Conference Contribution
Breckon, T., Han, J., & Richardson, J. (2012, November). Consistency in Muti-modal Automated Target Detection using Temporally Filtered Reporting. Presented at Proc. SPIE Electro-Optical Remote Sensing, Photonic Technologies, and Applications VI

Autotuning of Adaptive Mesh Refinement PDE Solvers on Shared Memory Architectures (2012)
Presentation / Conference Contribution
Nogina, S., Unterweger, K., & Weinzierl, T. (2012, December). Autotuning of Adaptive Mesh Refinement PDE Solvers on Shared Memory Architectures. Presented at PPAM 2011, Torun

A 3D extension to cortex like mechanisms for 3D object class recognition (2012)
Presentation / Conference Contribution
Flitton, G., Breckon, T., & Megherbi, N. (2012, December). A 3D extension to cortex like mechanisms for 3D object class recognition. Presented at 2012 IEEE Conference on Computer Vision and Pattern Recognition, Providence, RI, USA

Characterizing graphs of small carving-width (2012)
Presentation / Conference Contribution
Belmonte, R., van 't Hof, P., Kaminski, M., Paulusma, D., & Thilikos, D. (2012, December). Characterizing graphs of small carving-width

We characterize all graphs that have carving-width at most k for k = 1,2,3. In particular, we show that a graph has carving-width at most 3 if and only if it has maximum degree at most 3 and treewidth at most 2. This enables us to identify the immers... Read More about Characterizing graphs of small carving-width.

How to eliminate a graph (2012)
Presentation / Conference Contribution
Golovach, P., Heggernes, P., van 't Hof, P., Manne, F., Paulusma, D., & Pilipczuk, M. (2012, December). How to eliminate a graph

Vertex elimination is a graph operation that turns the neighborhood of a vertex into a clique and removes the vertex itself. It has widely known applications within sparse matrix computations. We define the Elimination problem as follows: given two g... Read More about How to eliminate a graph.

4-Coloring H-free graphs when H is small (2012)
Presentation / Conference Contribution
Golovach, P., Paulusma, D., & Song, J. (2012, December). 4-Coloring H-free graphs when H is small

The k-Coloring problem is to test whether a graph can be colored with at most k colors such that no two adjacent vertices receive the same color. If a graph G does not contain a graph H as an induced subgraph, then G is called H-free. For any fixed g... Read More about 4-Coloring H-free graphs when H is small.

Coloring graphs characterized by a forbidden subgraph (2012)
Presentation / Conference Contribution
Golovach, P. A., Paulusma, D., & Ries, B. (2012, December). Coloring graphs characterized by a forbidden subgraph

The Coloring problem is to test whether a given graph can be colored with at most k colors for some given k, such that no two adjacent vertices receive the same color. The complexity of this problem on graphs that do not contain some graph H as an in... Read More about Coloring graphs characterized by a forbidden subgraph.