Search
Skip to Search Results- 10Database Systems
- 4Approximation algorithms
- 3Computational biology
- 3Data Mining
- 2Algorithmics
- 2Cattle
- 29Computing Science, Department of
- 29Computing Science, Department of/Technical Reports (Computing Science)
- 3Agricultural, Food and Nutritional Science, Department of
- 3Agricultural, Food and Nutritional Science, Department of/Journal Articles (Agricultural, Food and Nutritional Science)
- 1Toolkit for Grant Success
- 1Toolkit for Grant Success/Educational Materials (Toolkit for Grant Success)
-
2008
Cai, Zhipeng, Lin, Guohui, Want, Lusheng, Chen, Zhi-Zhong
Technical report TR08-06. The Capacitated Multicast Tree Routing Problem is considered, in which only a limited number of destination nodes are allowed to receive data in one routing tree and multiple routing trees are needed to send data from the source node to all destination nodes. The goal...
-
2011
Goebel, Randy, Wang, Lusheng, Lin, Guohui, Li, Zhong
Technical report TR11-02. Given two genomic maps G1 and G2 each represented as a sequence of n gene markers, the maximal strip recovery (MSR) problem is to retain the maximum number of markers in both G1 and G2 such that the resultant subsequences, denoted as G1* and G2*, can be partitioned into...
-
2001
Antonie, Maria-Luiza, Zaiane, Osmar
Technical report TR01-04. Discriminating between text articles and automatically classifying documents is an essential task for many applications. With the prevalence of digital documents and the wide use of e-mail and web documents, text categorization is regaining interest and is becoming a...
-
2003
Jiang, Tao, Lin, Guohui, Chen, Zhi-Zhong
Technical report TR03-06. Given a set of species and their similarity data, an important problem in evolutionary biology is how to reconstruct a phylogeny (also called evolutionary tree) so that species are close in the phylogeny if and only if they have high similarity. Assume that the...
-
2002
Lee, Chi-Hoon, Foss, Andrew, Zaiane, Osmar, Wang, Weinan
Technical report TR02-03. Clustering is the problem of grouping data based on similarity and consists of maximizing the intra-group similarity while minimizing the iter-group similarity. While this problem has attracted the attention of many researchers for many years, we are witnessing a...
-
2004
Oliveira, Stanley, Zaiane, Osmar
Technical report TR04-17. Preserving privacy of individuals when data are shared for clustering is a complex problem. The challenge is how to protect the underlying attribute values subjected to clustering without jeopardizing the similarity between data objects under analysis. To address this...
-
2002
Zaiane, Osmar, Nascimento, Mario, Oliveira, Stanley
Technical report TR02-01. Research in information hiding has grown explosively. A large number of techniques have been proposed to discourage copyright infringement, tampering and unauthorized distribution of digital media (e.g. video, audio, and images). In this paper, we provide an overview of...
-
2012
Wang, Lusheng, Moore, Steve S., Cai, Zhipeng, Goebel, Randy, Lin, Guohui, Wang, Yining, Stothard, Paul
Background Single nucleotide polymorphism (SNP) genotyping assays normally give rise to certain percents of no-calls; the problem becomes severe when the target organisms, such as cattle, do not have a high resolution genomic sequence. Missing SNP genotypes, when related to target traits, would...
-
2001
Lu, Paul, El-Hajj, Mohammad, Zaiane, Osmar
Technical report TR01-12. Searching for frequent patterns in transactional databases is considered one of the most important data mining problems. Most current association mining algorithms, whether sequential or parallel, adopt an apriori-like algorithm that requires full multiple I/O scans of...