Technical Reports (Computing Science)
Technical Reports Collection
Items in this Collection
- 28Szafron, Duane
- 21Schaeffer, Jonathan
- 19Zaiane, Osmar
- 15Ozsu, M. Tamer
- 14Nascimento, Mario
- 13Yang, Herb
- 29Database Systems
- 18Artificial Intelligence
- 13Computer Games
- 9Computer Graphics
- 9Databases
- 8Communication Networks
-
2011
Amaral, Jose Nelson, Garg, Rahul
Technical report TR11-05. A new compilation framework enables the execution of numerical-intensive applications in an execution environment that is formed by multi-core Central Processing Units (CPUs) and Graphics Processing Units (GPUs). A critical innovation is the use of a variation of Linear...
-
2007
Culberson, Joseph, Yang, Fan, Holte, Robert
Technical report TR07-06. The effectiveness of heuristics search is influnced by the accuracy of the heuristic values. State space abstractions have been proved to be effective for generating admissible heuristics. In this paper, A general definition for abstractions is given. As a demonstration...
-
2007
Technical report TR07-04. Music-driven character animation extracts musical features from a song and uses them to create an animation. This paper presents a system that builds a new animation directly from musical attributes, rather than simply synchronizing it to the music like similar systems....
-
1993
Reinefeld, Alexander, Marsland, Tony
Technical report TR93-02. With the continuing price-performance improvement of small computers there is growing interest in looking again at some of the heuristic techniques developed for problem-solving and planning programs, to see if they can be enhanced or replaced by more algorithmic...
-
1996
Technical report TR96-26. Software design methods share many characteristics with design methods in other fields. All these methods are the progeny of philosophies of design that are in turn influenced by more general philosophic movements. This essay begins with the influence of philosophies of...
-
1991
Greenlaw, Raymond, Ruzzo, Walter L., Hoover, James
Technical report TR91-11. This paper serves two purposes. Firstly, it is an elementary introduction to the theory of P-completeness - the branch of complexity theory that focuses on identifying the problems in the class P that are \"hardest\" in the sense that they appear to lack highly parallel...
-
2013
In the field of computational game theory, games are often compared in terms of their size. This can be measured in several ways, including the number of unique game states, the number of decision points, and the total number of legal actions over all decision points. These numbers are either...
-
1992
Peters, Randal J., Szafron, Duane, Ozsu, M. Tamer
Technical report TR92-14. Object-oriented computing is influencing many areas of computer science including software engineering, user interfaces, operating systems, programming languages and database systems. The appeal of object-orientation is attributed to its higher levels of abstraction for...
-
Proteome Analyst - Transparent High-throughput Protein Annotation: Function, Localization and Custom Predictors
Download2003
Lu, Z., Eisner, Roman, Lu, Paul, Macdonell, Cam, Szafron, Duane, Greiner, Russell, Poulin, B., Wishart, David, Anvik, J., Habibi-Nazhad, B.
Technical report TR03-05. Modern sequencing technology now permits the sequencing of entire genomes, leading to thousands of new gene sequences in need of detailed annotation. It is too time consuming to predict the properties of each protein sequence manually and to organize the results of many...