Search
Skip to Search Results- 414Computing Science, Department of
- 315Computing Science, Department of/Technical Reports (Computing Science)
- 71Computing Science, Department of/Conference Papers (Computing Science)
- 23Computing Science, Department of/Journal Articles (Computing Science)
- 4Computing Science, Department of/Research Data and Materials (Computing Science)
- 1Computing Science, Department of/Presentations (Computing Science)
- 95Hindle, Abram
- 28Szafron, Duane
- 21Schaeffer, Jonathan
- 19Zaiane, Osmar
- 15Ozsu, M. Tamer
- 14Nascimento, Mario
- 29Database Systems
- 18Artificial Intelligence
- 13Computer Games
- 9Computer Graphics
- 9Databases
- 9Software Engineering
-
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...
-
2005
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
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)...
-
An O(N^1.695) Permutation Routing Algorithm on Augmented Data Manipulators
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
-
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...
-
2022
Kamienski, A.V., Hindle, Abram, Bezemer, C.P.
Game development is currently the largest industry in the entertainment segment and has a high demand for skilled game developers that can produce high-quality games. To satiate this demand, game developers need resources that can provide them with the knowledge they need to learn and improve...
-
2017
Borle, N.C., Feghhi, M., Stroulia, E., Greiner, R., Hindle, Abram
Testing is an integral part of the software development lifecycle, approached with varying degrees of rigor by different process models. Agile process models recommend Test Driven Development (TDD) as a key practice for reducing costs and improving code quality. The objective of this work is to...