In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
— Multicast solutions have been evolving from “bottom” to “top”, i.e., from IP layer (called IP multicast) to application layer (referred to as application layer multicas...
Li Lao, Jun-Hong Cui, Mario Gerla, Dario Maggiorin...
— Parallel TCP flows are broadly used in the high performance distributed computing community to enhance network throughput, particularly for large data transfers. Previous rese...
Comparing different Information Visualization (InfoVis) techniques is a challenging task and a necessary step to reach the users and their tasks. We evaluated the effectiveness in...
With the growing demand on cluster analysis for categorical data, a handful of categorical clustering algorithms have been developed. Surprisingly, to our knowledge, none has sati...