Website fingerprinting attacks allow a local, passive eavesdropper to identify a user's web
activity by leveraging packet sequence information. These attacks break the privacy …

Ming Li Paul Vitányi Fourth Edition Page 1 An Introduction to Kolmogorov Complexity and Its
Applications Ming Li Paul Vitányi Fourth Edition Texts in Computer Science Page 2 Texts in …

The aim of this paper is to give a comprehensive comparison of well-known longest common
subsequence algorithms (for two input strings) and study their behaviour in various …

Due to the fact that no NP-complete problem can be solved in polynomial time (unless P=
NP), many approximability results (both positive and negative) of NP-hard optimization …

We study the computational complexity and approximation of several problems arising in the
comparison of evolutionary trees. It is shown that the maximum agreement subtree (MAST) …

Given two rooted, labeled, and unordered trees, we consider the problem of finding the
largest common sub-tree and the problem of finding the edit distance between them. We …

Crowd markets have traditionally limited workers by not providing transparency information
concerning which tasks pay fairly or which requesters are unreliable. Researchers believe …

The frame approach for representing knowledge (ie, collection of frames are linked together
into frame-system) has been suggested by Marvin Minsky. In this approach, the frame …

In this paper we introduce an Ant Colony Optimisation (ACO) algorithm for the Shortest
Common Supersequence (SCS) problem, which has applications in production system …

Highly dependable communication networks usually rely on some kind of Fast Re-Route
(FRR) mechanism which allows to quickly re-route traffic upon failures, entirely in the data …