Skip to main content

Research Repository

Advanced Search

All Outputs (3019)

The Educational Value of Mapping Studies of Software Engineering Literature (2010)
Presentation / Conference Contribution
Kitchenham, B., Brereton, P., & Budgen, D. (2010, December). The Educational Value of Mapping Studies of Software Engineering Literature. Presented at 32nd International Conference on Software Engineering (ICSE 2010) ACM Press, Cape Town, South Africa

We identify three challenges related to the provenance of the material we use in teaching software engineering. We suggest that these challenges can be addressed by using evidence-based software engineering (EBSE) and its primary tool of systematic l... Read More about The Educational Value of Mapping Studies of Software Engineering Literature.

Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution. (2010)
Presentation / Conference Contribution
Bordewich, M., & Mihaescu, R. (2010, September). Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution. Presented at 10th Workshop on Algorithms in Bioinformatics (WABI 2010), Liverpool

Distance based phylogenetic methods attempt to reconstruct an accurate phylogenetic tree relating a given set of taxa from an estimated matrix of pair-wise distances between taxa. This paper examines two distance based algorithms (GreedyBME and FastM... Read More about Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution..

The complexity of the list homomorphism problem for graphs. (2010)
Presentation / Conference Contribution
Egri, L., Krokhin, A., Larose, B., & Tesson, P. (2010, December). The complexity of the list homomorphism problem for graphs. Presented at Symposium on Theoretical Aspects of Computer Science., Nancy, France

Simulating Multiple Character Interactions with Collaborative and Adversarial Goals (2010)
Journal Article
Shum, H. P., Komura, T., & Yamazaki, S. (2012). Simulating Multiple Character Interactions with Collaborative and Adversarial Goals. IEEE Transactions on Visualization and Computer Graphics, 18(5), 741-752. https://doi.org/10.1109/tvcg.2010.257

This paper proposes a new methodology for synthesizing animations of multiple characters, allowing them to intelligently compete with one another in dense environments, while still satisfying requirements set by an animator. To achieve these two conf... Read More about Simulating Multiple Character Interactions with Collaborative and Adversarial Goals.

Satisfiability of Acyclic and Almost Acyclic CNF Formulas (2010)
Presentation / Conference Contribution
Ordyniak, S., Paulusma, D., & Szeider, S. (2010, December). Satisfiability of Acyclic and Almost Acyclic CNF Formulas. Presented at IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), Chennai, India

On the intersection of tolerance and cocomparability graphs (2010)
Presentation / Conference Contribution
Mertzios, G., & Zaks, S. (2010, December). On the intersection of tolerance and cocomparability graphs. Presented at 21st International Symposium on Algorithms and Computation (ISAAC), Jeju Island, Korea

It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. Since cocomparability graphs can be efficiently recognized, a positive answer to this conject... Read More about On the intersection of tolerance and cocomparability graphs.

Object Recognition using 3D SIFT in Complex CT Volumes (2010)
Presentation / Conference Contribution
Flitton, G., Breckon, T., & Megherbi, N. (2010, September). Object Recognition using 3D SIFT in Complex CT Volumes. Presented at Proc. British Machine Vision Conference

Can we evaluate the quality of software engineering experiments? (2010)
Presentation / Conference Contribution
Kitchenham, B., Sjøberg, D. I., Brereton, O. P., Budgen, D., Dybå, T., Höst, M., Pfahl, D., & Runeson, P. (2010, September). Can we evaluate the quality of software engineering experiments?. Presented at ESEM 2010 - 2010 ACM-IEEE International Symposium on Empirical Software Engineering and Measurement, Bolzano-Bozen, Italy

Context: The authors wanted to assess whether the quality of published human-centric software engineering experiments was improving. This required a reliable means of assessing the quality of such experiments. Aims: The aims of the study were to conf... Read More about Can we evaluate the quality of software engineering experiments?.

Computing role assignments of chordal graphs (2010)
Journal Article
Hof, P. V. '., Paulusma, D., & Rooij, J. V. (2010). Computing role assignments of chordal graphs. Theoretical Computer Science, 411(40-42), 3601-3613. https://doi.org/10.1016/j.tcs.2010.05.041

In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1,…,k}, called a role, to each vertex of G such that any two vertices with the same role have the same sets of roles a... Read More about Computing role assignments of chordal graphs.

Computing sharp 2-factors in claw-free graphs (2010)
Journal Article
Broersma, H., & Paulusma, D. (2010). Computing sharp 2-factors in claw-free graphs. Journal of discrete algorithms, 8(3), 321-329. https://doi.org/10.1016/j.jda.2009.07.001

In a previous paper we obtained an upper bound for the minimum number of components of a 2-factor in a claw-free graph. This bound is sharp in the sense that there exist infinitely many claw-free graphs for which the bound is tight. In this paper we... Read More about Computing sharp 2-factors in claw-free graphs.

Sketching-Based Skeleton Generation (2010)
Presentation / Conference Contribution
Zheng, Q., Li, F. L., & Lau, R. (2010, December). Sketching-Based Skeleton Generation. Presented at 2010 3rd IEEE International Conference on Ubi-Media Computing (U-Media 2010), Jinhua, China

Articulated character animation can be performed by manually creating and rigging a skeleton into an unfolded 3D object. Such tasks are not trivial, as it requires a substantial amount of training and practices. Although methods have been proposed to... Read More about Sketching-Based Skeleton Generation.

CSP duality and trees of bounded pathwidth. (2010)
Journal Article
Carvalho, C., Dalmau, V., & Krokhin, A. (2010). CSP duality and trees of bounded pathwidth. Theoretical Computer Science, 411(34-36), 3188-3208. https://doi.org/10.1016/j.tcs.2010.05.016

We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of homomorphism dualities involving trees of bounded pathwidth and in algeb... Read More about CSP duality and trees of bounded pathwidth..

An Adaptive Course Generation Framework (2010)
Journal Article
Li, F., Lau, R., & Dharmendran, P. (2010). An Adaptive Course Generation Framework. International Journal of Distance Education Technologies, 8(3), 74-85. https://doi.org/10.4018/jdet.2010070104

Existing adaptive e-learning methods are supported by student (user) profiling for capturing student characteristics, and course structuring for organizing learning materials according to topics and levels of difficulties. Adaptive courses are then g... Read More about An Adaptive Course Generation Framework.

Constant-Rank Codes and Their Connection to Constant-Dimension Codes (2010)
Journal Article
Gadouleau, M., & Yan, Z. (2010). Constant-Rank Codes and Their Connection to Constant-Dimension Codes. IEEE Transactions on Information Theory, 56(7), 3207-3216. https://doi.org/10.1109/tit.2010.2048447

Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random linear network coding. What the maximal cardinality of any constant-dimension code with finite dimension and minimum distance i... Read More about Constant-Rank Codes and Their Connection to Constant-Dimension Codes.