Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
—Many factors are believed to increase the vulnerability of software system; for example, the more widely deployed or popular is a software system the more likely it is to be att...
Thomas Zimmermann, Nachiappan Nagappan, Laurie A. ...
Abstract. In this paper, a Fuzzy Dominant Texture Descriptor is proposed for semantically describing an image. This fuzzy descriptor is defined over a set of fuzzy sets modelling ...
For a graph G = (V, E) we consider vertex-k-labellings f : V → {1, 2, . . . , k} for which the induced edge weighting w : E → {2, 3, . . . , 2k} with w(uv) = f(u) + f(v) is inj...
Stephan Brandt, Jozef Miskuf, Dieter Rautenbach, F...
During the last years a great number of Query Performance Prediction methods have been proposed. However, this explosion of prediction method proposals have not been paralleled by ...