We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao ...
In this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conj...
Digital planarity is defined by digitizing Euclidean planes in the three-dimensional digital space of voxels; voxels are given either in the grid point or the grid cube model. Th...
Valentin E. Brimkov, David Coeurjolly, Reinhard Kl...
The context concept can be used with advantage in the area of Computer-Supported Cooperative Work. In many studies, several forms of context have been used without explicit associ...
– This paper analyses the results obtained when different topologies of 1-Dimensional Kohonen Networks where used to classify color pictures taken to Popocatépetl Volcano (locat...