The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
Abstract— In this paper we analyze the positioning of landmarks in coordinates-based Internet distance prediction approaches with focus on Global Network Positioning (GNP). We sh...
— TCP-Friendly Rate Control (TFRC) is being adopted in Internet standards for congestion control of various streaming media applications. In this paper, we consider the transmiss...
This paper presents a theoretical security analysis of lattice data hiding. The security depends on the secrecy of a dither signal that randomizes the codebook. If the same secret...
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...