Skip to main content

Research Repository

Advanced Search

Outputs (84)

Hamiltonian cycles through prescribed edges in k-ary n-cubes. (2011)
Presentation / Conference Contribution
Stewart, I. (2011, December). Hamiltonian cycles through prescribed edges in k-ary n-cubes. Presented at 5th Annual International Conference on Combinatorial Optimization and Applications, COCOA'11., Zhangjiajie, China

We prove that if P is a set of at most 2n − 1 edges in a k-ary n-cube, where k ≥ 4 and n ≥ 2, then there is a Hamiltonian cycle on which every edge of P lies if, and only if, the subgraph of the k-ary n-cube induced by the edges of P is a vertex-disj... Read More about Hamiltonian cycles through prescribed edges in k-ary n-cubes..

On the approximation complexity hierarchy. (2011)
Presentation / Conference Contribution
Bordewich, M. (2010, September). On the approximation complexity hierarchy. Presented at 8th International Workshop on International Workshop on Approximation and Online Algorithms, WAOA 2010, Liverpool

This paper presents an extension of Ladner’s Theorem to the approximation complexity hierarchy. In 1975 Ladner proved that if P≠NP, then there exists an incomplete problem A which is neither in P nor NP-complete. Here we show that if RP≠NP, then ther... Read More about On the approximation complexity hierarchy..

ADE: The Adaptive Display Environment for Adaptive Hypermedia (2011)
Presentation / Conference Contribution
Scotton, J., Stewart, C., & Cristea, A. I. (2011, December). ADE: The Adaptive Display Environment for Adaptive Hypermedia. Presented at Proceedings of the ACM Hypertext 2011 International Conference

Real-time People and Vehicle Detection from UAV Imagery (2011)
Presentation / Conference Contribution
Gaszczak, A., Breckon, T., & Han, J. (2011, December). Real-time People and Vehicle Detection from UAV Imagery. Presented at Proc. SPIE Conference Intelligent Robots and Computer Vision XXVIII: Algorithms and Techniques