Technical Reports (Computing Science)

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...

2005

Basu, Anup, Wang, Tao

Technical report TR05-31. A 3D thinning algorithm erodes a 3D image layer by layer to extract the skeletons. This paper presents an improved fully parallel 3D thinning algorithm which extracts medial lines from a 3D image. This algorithm is based on Ma and Sonka's thinning algorithm, which fails...

2000

Li, Fulu, Nikolaidis, Ioanis

Technical report TR00-16. A key requirement for the successful deployment of Video-on-Demand (VoD) systems is to maintain both bandwidth efficiency as well as tolerable startup latency. The startup latency is defined as the interval between the point a user \"tunes-in\"' to (starts downloading)...

1997

Elmallah, Ehab, Lam, Chin-Hung

Technical report TR97-07. This paper shows an O(N^1.695) time algorithm for routing any arbitrary admissible permutation on Augmented Data Manipulator networks. The devised algorithm appears to be the first known polynomial time algorithm for solving the above problem. | TRID-ID TR97-07

1995

Vittal, Chiradeep

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...

2004

Barone, Dante, Caetano, Tiberio, Caelli, Terry

Technical report TR04-03. We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relations over a simple triangulated graph that retains the same informational content as the...

1998

Schaeffer, Jonathan, Novillo, Diego, Unrau, Ronald

Technical report TR98-11. Most current compiler analysis techniques are unable to cope with the semantics introduced by explicit parallel and synchronization constructs in parallel programs. In this paper we introduce new analysis and optimization techniques for compiling explicitly parallel...

1998

Kratsch, D., Stewart, Lorna

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...

2003

Leitch, Robert

Technical report TR03-04. | TRID-ID TR03-04

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...