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
Malhotra, Baljeet, Lin, Guohui
Technical report TR08-07. In gene expression microarray data analysis, biclustering has been demonstrated to be one of the most effective methods for discovering gene expression patterns under various conditions. We present in this study a framework to take advantage of the homogeneously...
-
2022
Bangash, A.A., Ali, K., Hindle, Abram
Android byte-code transformations are used to optimize applications (apps) in terms of run-time performance and size. But do they affect the energy consumption during this process? If they do, can we employ them to reduce an app’s energy consumption? Given that most existing energy optimization...
-
A comparison of Junction Tree and Relaxation Algorithms for point matching using different distance metrics
Download2004
Barone, Dante, Caelli, Terry, Caetano, Tiberio
Technical report TR04-04. We have developed a polynomial time optimal method for a class of attributed graph matching problems using the Junction Tree algorithm from Graphical Models. In this paper we compare this method with standard probabilistic relaxation labeling using different forms of...
-
2002
Rafiei, Davood, Oliveira, Stanley
Technical report TR02-11. Various query languages have been proposed for XML, some inspired by database query languages (e.g. SQL and OQL) and others introduced by documents community. To fulfill its role of a standardization body,W3C has identified a number of requirements for XML query...
-
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...
-
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...
-
1996
Technical report TR96-17. Shared memory is an attractive programming model for designing parallel and distributed applications. In the past decade, a popular research topic has been the design of systems to provide the shared memory abstraction on physically distributed memory machines. This...
-
2013
Alipour, A., Hindle, Abram, Stroulia, E
Bug-tracking and issue-tracking systems tend to be populated with bugs, issues, or tickets written by a wide variety of bug reporters, with different levels of training and knowledge about the system being discussed. Many bug reporters lack the skills, vocabulary, knowledge, or time to...
-
2016
Hindle, Abram, Alipour, A., Stroulia, E.
The issue-tracking systems used by software projects contain issues, bugs, or tickets written by a wide variety of bug reporters, with different levels of training and knowledge about the system under development. Typically, reporters lack the skills and/or time to search the issue-tracking...