Skip to main content

Research Repository

Advanced Search

Outputs (1513)

Curve subdivision with arc-length control. (2009)
Journal Article
Hernandez-Mederos, V., Estrada-Sarlabous, J., Morales, S., & Ivrissimtzis, I. (2009). Curve subdivision with arc-length control. Computing, 86(2-3), 151-169. https://doi.org/10.1007/s00607-009-0068-1

In this paper we present a new nonstationary, interpolatory, curve subdivision scheme. We show that the scheme converges and the subdivision curve is continuous. Moreover, starting with the chord length parametrization of the initial polygon, we obta... Read More about Curve subdivision with arc-length control..

New PDE-based methods for image enhancement using SOM and Bayesian inference in various discretization schemes (2009)
Journal Article
Karras, D., & Mertzios, G. (2009). New PDE-based methods for image enhancement using SOM and Bayesian inference in various discretization schemes. Measurement Science and Technology, 20(10), Article 104012. https://doi.org/10.1088/0957-0233/20/10/104012

A novel approach is presented in this paper for improving anisotropic diffusion PDE models, based on the Perona–Malik equation. A solution is proposed from an engineering perspective to adaptively estimate the parameters of the regularizing function... Read More about New PDE-based methods for image enhancement using SOM and Bayesian inference in various discretization schemes.

On the core and f-nucleolus of flow games (2009)
Journal Article
Kern, W., & Paulusma, D. (2009). On the core and f-nucleolus of flow games. Mathematics of Operations Research, 34(4), 981-991. https://doi.org/10.1287/moor.1090.0405

Using the ellipsoid method, both Deng et al. [Deng, X., Q. Fang, X. Sun. 2006. Finding nucleolus of flow game. Proc. 17th ACM-SIAM Sympos. Discrete Algorithms. ACM Press, New York, 124–131] and Potters et al. [Potters, J., H. Reijnierse, A. Biswas. 2... Read More about On the core and f-nucleolus of flow games.

Mixing 3-colourings in bipartite graphs (2009)
Journal Article
Cereceda, L., van den Heuvel, J., & Johnson, M. (2009). Mixing 3-colourings in bipartite graphs. European Journal of Combinatorics, 30(7), 1593-1606. https://doi.org/10.1016/j.ejc.2009.03.011

For a 3-colourable graph G, the 3-colour graph of G, denoted C_3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the corresponding colourings differ on precisely one vertex of G. We consider the fol... Read More about Mixing 3-colourings in bipartite graphs.

Cross-domain investigation of empirical practices (2009)
Journal Article
Budgen, D., Bailey, J., Turner, M., Kitchenham, B., Brereton, P., & Charters, S. (2009). Cross-domain investigation of empirical practices. IET Software, 3(5), 410-421. https://doi.org/10.1049/iet-sen.2008.0106

The authors are seeking the best ways to employ evidence-based practices in software engineering research and practice so that the outcomes can inform practice and policy-making. The objective of this study is to investigate how other academic discip... Read More about Cross-domain investigation of empirical practices.

λ-backbone colorings along pairwise disjoint stars and matchings (2009)
Journal Article
Broersma, H., Fujisawa, J., Marchal, L., Paulusma, D., Salman, A., & Yoshimoto, K. (2009). λ-backbone colorings along pairwise disjoint stars and matchings. Discrete Mathematics, 309(18), 5596-5609. https://doi.org/10.1016/j.disc.2008.04.007

Given an integer λ≥2, a graph G=(V,E) and a spanning subgraph H of G (the backbone of G), a λ-backbone coloring of (G,H) is a proper vertex coloring V→{1,2,…} of G, in which the colors assigned to adjacent vertices in H differ by at least λ. We study... Read More about λ-backbone colorings along pairwise disjoint stars and matchings.

Hard constraint satisfaction problems have hard gaps at location 1 (2009)
Journal Article
Jonsson, P., Krokhin, A., & Kuivinen, F. (2009). Hard constraint satisfaction problems have hard gaps at location 1. Theoretical Computer Science, 410(38-40), 3856-3874. https://doi.org/10.1016/j.tcs.2009.05.022

An instance of the maximum constraint satisfaction problem (Max CSP) is a finite collection of constraints on a set of variables, and the goal is to assign values to the variables that maximises the number of satisfied constraints. Max CSP captures m... Read More about Hard constraint satisfaction problems have hard gaps at location 1.