We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...
Mohammad Al Hasan, Saeed Salem, Benjarath Pupacdi,...
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service ca...
—The proliferation of applications that must reliably distribute bulk data to a large number of autonomous clients motivates the design of new multicast and broadcast protocols. ...
John W. Byers, Michael Luby, Michael Mitzenmacher,...
Our aim is to investigate reliable transmission for multicast communication and explore its relationship to multicast routing. We derive two characterizations that enable the comp...
— In this paper, we consider the thermal placement problem for gate arrays. We introduce a new combinatorial optimization problem, matrix synthesis problem (MSP), to model the th...