On combining multiple clusterings
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Kolmogorov Complexity Theory over the Reals
Electronic Notes in Theoretical Computer Science (ENTCS)
Constructive reduction: understanding uncomputability through programming
ACM SIGCSE Bulletin
On combining multiple clusterings: an overview and a new perspective
Applied Intelligence
Theoretical Computer Science
| Hi-index | 0.00 |
From the Publisher:Highlights:Motivates theoretical developments by connecting them to practical issues.Introduces every result and proof with an informal overview to build intuition. Introduces models through finite automata, then builds to universal models, including recursion theory.Emphasizes complexity theory, beginning with a detailed discussion of resource use in computation.Includes large numbers of examples and illustrates abstract ideas through diagramsGives informal presentations of difficult recent results with profound implications for computing.