We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opat...
This paper presents the development of a set of ontologies for use in messaging systems within military and emergency first responder command and control applications. These ontolo...
Duc N. Nguyen, Joseph B. Kopena, Boon Thau Loo, Wi...
A "botnet" consists of a network of compromised computers controlled by an attacker ("botmaster"). Recently botnets have become the root cause of many Internet ...
We present a system for quickly and cheaply building transcribed speech corpora containing utterances from many speakers in a variety of acoustic conditions. The system consists o...
Thad Hughes, Kaisuke Nakajima, Linne Ha, Atul Vasu...