The debate within the Web community over the optimal means by which to organize information often pits formalized classifications against distributed collaborative tagging systems...
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
It has been well recognized that data mining is an interactive and iterative process. In order to support this process, one of the long-term goals of data mining research has been...
In many practical distributed source coding (DSC) applications, correlation information has to be estimated at the encoder in order to determine the encoding rate. Coding efficien...