We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, St&e...
Recovering design patterns applied in a system can help refactoring the system. Machine learning algorithms have been successfully applied in mining data patterns. However, one of...
This paper describes an adaptive system called VL-PATSy, an extension to an existing system (PATSy) that adds a mechanism for serving vicarious learning (VL) resources. Vicarious l...
IP Telephony based on Peer-to-Peer (P2P) technology has being gaining attentions for its innovative approach to providing VoIP service. At the same time, it has raised many new re...
Abstract— This paper introduces quantitative measurements/metrics of qualitative entertainment features within interactive playgrounds inspired by computer games and proposes art...
Georgios N. Yannakakis, Henrik Hautop Lund, John H...