Department of Computer Science

Anomalous Behavior Detection: Supporting Independent Living (2008)
Book Chapter
Monekosso, D. N., & Remagnino, P. (2009). Anomalous Behavior Detection: Supporting Independent Living. In D. Monekosso, P. Remagnino, & Y. Kuno (Eds.), Intelligent Environments: Methods, Algorithms and Applications (33-48). Springer. https://doi.org/10.1007/978-1-84800-346-0_3

Augmenting Professional Training, an Ambient Intelligence Approach (2008)
Book Chapter
Zhan, B., Monekosso, D. N., Remagnino, P., Velastin, S. A., & Rush, S. (2009). Augmenting Professional Training, an Ambient Intelligence Approach. In D. Monekosso, P. Remagnino, & Y. Kuno (Eds.), Intelligent Environments: Methods, Algorithms and Applications (105-121). Springer. https://doi.org/10.1007/978-1-84800-346-0_7

Point Set Denoising using a Variational Bayesian Method (2008)
Journal Article
Yoon, M., & Ivrissimtzis, I. (2008). Point Set Denoising using a Variational Bayesian Method. Jeongbo gwahaghoe nonmunji. keompyuting ui silje, 14(5), 527-531

For statistical modeling, the model parameters are usually estimated by maximizing a probability measure, such as the likelihood or the posterior. In contrast, a variational Bayesian method threats the parameters of the model as probability distribut... Read More about Point Set Denoising using a Variational Bayesian Method.

Comparing universal covers in polynomial time (2008)
Presentation / Conference Contribution
Fiala, J., & Paulusma, D. (2008, December). Comparing universal covers in polynomial time. Presented at 3rd International Computer Science Symposium in Russia, Moscow, Russia

The universal cover T G of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from T G to G. Universal covers have major applications in the area of distributed computing. It is w... Read More about Comparing universal covers in polynomial time.

Computing sharp 2-factors in claw-free graphs (2008)
Presentation / Conference Contribution
Broersma, H. J., & Paulusma, D. (2008, December). Computing sharp 2-factors in claw-free graphs. Presented at 33th International Symposium on Mathematical Foundations of Computer Science, Toru´n, Poland

In a recently submitted 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... Read More about Computing sharp 2-factors in claw-free graphs.

An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs (2008)
Presentation / Conference Contribution
Mertzios, G., & Unger, W. (2008, May). An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs. Presented at 19th International Workshop on Combinatorial Algorithms (IWOCA), Nagoya, Japan

The friendship problem on graphs (2008)
Presentation / Conference Contribution
Mertzios, G., & Unger, W. (2008, May). The friendship problem on graphs. Presented at 1st International Conference on Relations, Orders and Graphs : Interaction with Computer Science (ROGICS), Mahdia, Tunisia

Outputs (87)