Search
Skip to Search Results- 3Nascimento, Mario
- 2Coman, Alexandru
- 2MacGregor, Mike
- 2Malhotra, Baljeet
- 2Nikolaidis, Ioanis
- 2Sander, Joerg
- 25Graduate and Postdoctoral Studies (GPS), Faculty of
- 25Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
- 11Computing Science, Department of
- 11Computing Science, Department of/Technical Reports (Computing Science)
- 1Master of Science in Internetworking (MINT)
- 1Master of Science in Internetworking (MINT)/Capstone Projects & Reports (Master of Science in Internetworking (MINT))
-
2008
Technical report TR08-04. There are many network intrusion detection and prevention tools available to the network administrator of today, but Snort has become an enterprise standard due to its open source nature and also due to the fact that there are many open source operating systems which...
-
Algorithmic Awareness Among Computing Science Students: Exploring Perspectives on Responsible Design and Use of Social Media
DownloadFall 2022
Computational literacy and awareness have emerged as significant public and academic concerns. Implementing robust algorithm systems on social communication platforms may have positive and negative consequences on all age groups in society, particularly on the most frequent users, young adults....
-
2006
Nascimento, Mario, Coman, Alexandru, Sander, Joerg
Technical report TR06-24. Wireless sensor networks have received much attention recently. Given their autonomy, flexibility and large range of functionality, they can be used as an effective and discrete means for monitoring data in many domains. Typically the network autonomy implies a limited...
-
1998
Technical report TR98-06. In this paper, we examine the bandwidth problem in circular-arc graphs, chordal graphs with a bounded number of leaves in the clique tree, and k-polygon graphs (fixed k). All of these graph classes admit efficient approximation algorithms which are based on exact or...
-
Fall 2015
In this thesis, we consider two closely related clustering problems, Min Sum k-Clustering (MSkC) and Balanced k-Median (BkM). In Min Sum k-clustering, one is given a graph and a parameter k, and has to partition the vertices in the graph into k clusters to minimize the sum of pairwise distances...