A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring...
We propose a range of deep lexical acquisition methods which make use of morphological, syntactic and ontological language resources to model word similarity and bootstrap from a ...
Abstract: Abrupt shifts in the level of a time series represent important information and should be preserved in statistical signal extraction. We investigate rules for detecting l...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial. This connection enables us to extend the study to other important polynomial i...
—There are several types of landform and objects in the virtual environmentsuchasobstacles,moveobjectsanditems…etc.Apathfindingavatar shouldevaluatethewholeenvironmentproperly,...