Skip to main content

Research Repository

Advanced Search

All Outputs (40)

My online teacher 2.0 (2008)
Journal Article
Ghali, F., Cristea, A. I., & Stewart, C. (2008). My online teacher 2.0

Interaction patches for multi-character animation (2008)
Journal Article
Shum, H. P., Komura, T., Shiraishi, M., & Yamazaki, S. (2008). Interaction patches for multi-character animation. ACM Transactions on Graphics, 27(5), Article 114. https://doi.org/10.1145/1409060.1409067

We propose a data-driven approach to automatically generate a scene where tens to hundreds of characters densely interact with each other. During off-line processing, the close interactions between characters are precomputed by expanding a game tree,... Read More about Interaction patches for multi-character animation.

Selecting Taxa to Save or Sequence: Desirable Criteria and a Greedy Solution (2008)
Journal Article
Bordewich, M., Rodrigo, A., & Semple, C. (2008). Selecting Taxa to Save or Sequence: Desirable Criteria and a Greedy Solution. Systematic Biology, 57(6), 825-834. https://doi.org/10.1080/10635150802552831

Three desirable properties for any method of selecting a subset of evolutionary units (EUs) for conservation or for genomic sequencing are discussed. These properties are spread, stability, and applicability. We are motivated by a practical case in w... Read More about Selecting Taxa to Save or Sequence: Desirable Criteria and a Greedy Solution.

An Effective Error Resilient Packetization Scheme for Progressive Mesh Transmission over Unreliable Networks (2008)
Journal Article
Yang, B., Li, F., Pan, Z., & Wang, X. (2008). An Effective Error Resilient Packetization Scheme for Progressive Mesh Transmission over Unreliable Networks. Journal of Computer Science and Technology, 23(6), 1015-1025. https://doi.org/10.1007/s11390-008-9195-y

When a 3D model is transmitted over a lossy network, some model information may inevitably be missing.Under such situation, one may not be able to visualize the receiving model unless the lost model information has been retransmitted. Progressive mod... Read More about An Effective Error Resilient Packetization Scheme for Progressive Mesh Transmission over Unreliable Networks.

Category-based Equational Reasoning: An Approach to Ontology Integration (2008)
Journal Article
Geldart, J., & Song, W. (2009). Category-based Equational Reasoning: An Approach to Ontology Integration. Journal of Logic and Computation, 19(5), 791-806. https://doi.org/10.1093/logcom/exn044

Incorporating dynamic, general computational knowledge into Semantic Web ontologies is becoming increasingly important. The Semantic Web is now being used to model the behaviour of highly dynamic domains such as web-services, but current approaches t... Read More about Category-based Equational Reasoning: An Approach to Ontology Integration.

A 3-approximation algorithm for the subtree distance between phylogenies (2008)
Journal Article
Bordewich, M., McCartin, C., & Semple, C. (2008). A 3-approximation algorithm for the subtree distance between phylogenies. Journal of discrete algorithms, 6(3), 458-471. https://doi.org/10.1016/j.jda.2007.10.002

In this paper, we give a (polynomial-time) 3-approximation algorithm for the rooted subtree prune and regraft distance between two phylogenetic trees. This problem is known to be NP-complete and the best previously known approximation algorithm is a... Read More about A 3-approximation algorithm for the subtree distance between phylogenies.

The approximability of MAX CSP with fixed-value constraints (2008)
Journal Article
Deineko, V., Jonsson, P., Klasson, M., & Krokhin, A. (2008). The approximability of MAX CSP with fixed-value constraints. Journal of the ACM, 55(4), Article 16. https://doi.org/10.1145/1391289.1391290

In the maximum constraint satisfaction problem (MAX CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given finite domain to the variables so as to maxi... Read More about The approximability of MAX CSP with fixed-value constraints.

Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies (2008)
Journal Article
Madelaine, F., & Stewart, I. (2008). Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies. Discrete Mathematics, 308(18), 4144-4164. https://doi.org/10.1016/j.disc.2007.08.007

We improve upon the best known upper and lower bounds on the sizes of minimal feedback vertex sets in butterflies. Also, we construct new feedback vertex sets in grids so that for a large number of pairs $(n,m)$, the size of our feedback vertex set i... Read More about Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies.

Presenting software engineering results using structured abstracts: A randomised experiment. (2008)
Journal Article
Budgen, D., Kitchenham, B. A., Charters, S., Turner, M., Brereton, P., & Linkman, S. (2008). Presenting software engineering results using structured abstracts: A randomised experiment. Empirical Software Engineering, 13(4), 435-468. https://doi.org/10.1007/s10664-008-9075-7

When conducting a systematic literature review, researchers usually determine the relevance of primary studies on the basis of title and abstract. However, experience indicates that the abstracts for many software engineering papers are of too poor a... Read More about Presenting software engineering results using structured abstracts: A randomised experiment..

Computational complexity of auditing finite attributes in statistical databases (2008)
Journal Article
Jonsson, P., & Krokhin, A. (2008). Computational complexity of auditing finite attributes in statistical databases. Journal of Computer and System Sciences, 74(5), 898-909. https://doi.org/10.1016/j.jcss.2008.02.002

We study the computational complexity of auditing finite attributes in databases allowing statistical queries. Given a database that supports statistical queries, the auditing problem is to check whether an attribute can be completely determined or n... Read More about Computational complexity of auditing finite attributes in statistical databases.

Embedding long paths in k-ary n-cubes with faulty nodes and links (2008)
Journal Article
Stewart, I., & Xiang, Y. (2008). Embedding long paths in k-ary n-cubes with faulty nodes and links. IEEE Transactions on Parallel and Distributed Systems, 19(8), 1071-1085. https://doi.org/10.1109/tpds.2007.70787

Let $k \geq 4$ be even and let $n \geq 2$. Consider a faulty k-ary n-cube $Q_n^k$ in which the number of node faults $f_n$ and the number of link faults $f_e$ are such that $f_n + f_e \leq 2n-2$. We prove that given any two healthy nodes s and e of $... Read More about Embedding long paths in k-ary n-cubes with faulty nodes and links.

The computational complexity of graph contractions II: two tough polynomially solvable cases (2008)
Journal Article
Levin, A., Paulusma, D., & Woeginger, G. (2008). The computational complexity of graph contractions II: two tough polynomially solvable cases. Networks, 52(1), 32-56. https://doi.org/10.1002/net.20249

For a fixed pattern graph H, let H-CONTRACTIBILITY denote the problem of deciding whether a given input graph is contractible to H. This article is part II of our study on the computational complexity of the H-CONTRACTIBILITY problem. In the first ar... Read More about The computational complexity of graph contractions II: two tough polynomially solvable cases.