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
-
1998
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...
-
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...
-
1994
Culberson, Joseph, Evans, Patricia
Technical report TR94-09. In this paper we explore the relationship between asymmetries in deletion algorithms used in updating binary search trees, and the resulting long term behavior of the search trees. We show that even what would appear to be negligible asymmetric effects accumulate to...
-
2006
Technical report TR06-09. This paper presents a new technique, called aura 3D textures, for generating solid textures based on input examples. Our method is fully automatic and requires no user interactions in the process. Given an input texture sample, our method first creates its aura matrix...
-
2005
Technical report TR05-30. This paper presents a new technique, called aura texture, for generating synthetic textures from input examples. The basic idea of the new approach is to model textures using Asymmetric Gray Level Aura Matrices (AGLAMs), which give (the proof is in a recently submitted...
-
Autoepistemic Circumscription and Logic Programming
1992
Technical report TR92-18. We propose a framework of autoepistemic reasoning in which the underlying semantics is determined by the choice of a nonmonotonic inference mechanism and by specifying a belief constraint. While the latter makes the approach flexible in meeting possibly different...
-
Automated Topic Naming Supporting Cross-project Analysis of Software Maintenance Activities
Download2013
Hindle, Abram, Ernst, N.A., Godfrey, M.W., Mylopoulos, J.
Software repositories provide a deluge of software artifacts to analyze. Researchers have attempted to summarize, categorize, and relate these artifacts by using semi-unsupervised machine-learning algorithms, such as Latent Dirichlet Allocation (LDA). LDA is used for concept and topic analysis to...
-
Automated topic naming to support cross-project analysis of software maintenance activities
Download2011
Hindle, Abram, Ernst, N., Godfrey, M.M., Mylopoulos, J.
Researchers have employed a variety of techniques to extract underlying topics that relate to software development artifacts. Typically, these techniques use semi-unsupervised machine-learning algorithms to suggest candidate word-lists. However, word-lists are difficult to interpret in the...