Search
Skip to Search Results- 31Graduate and Postdoctoral Studies (GPS), Faculty of
- 31Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
- 13Biological Sciences, Department of
- 13Biological Sciences, Department of/Journal Articles (Biological Sciences)
- 12Computing Science, Department of
- 12Computing Science, Department of/Technical Reports (Computing Science)
-
2007
Guan, L., Guo, Y., Liu, T., Li, H., Wang, J., Zheng, W.M., Wong, G.K.
Background The main two sorts of automatic gene annotation frameworks are ab initio and alignment-based, the latter splitting into two sub-groups. The first group is used for intra-species alignments, among which are successful ones with high specificity and speed. The other group contains more...
-
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....
-
Fall 2019
Scheduling problems are problems in which jobs are assigned to machines at particular times. A common objective of scheduling is to schedule as many jobs before their deadline as possible, called Throughput Maximization. In this thesis, we provide algorithms for various...
-
1995
Technical report TR95-14. Multimedia applications need support from an underlying multimedia storage system to store and retrieve multimedia objects. The presence of spatio-temporal and composition relationships between the objects, their large volume and their inherent distribution pose...
-
Spring 2016
While the World Wide Web has always been treated as an immense source of data, most information it provides is usually deemed unstructured and sometimes ambiguous, which in turn makes it unreliable. But the web also contains a relatively large number of structured data in the form of tables,...
-
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...