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
-
Temporality in Object Database Management Systems
1998
Technical report TR98-04. Conventional databases represent the state of an enterprise at one particular point in time. That is, they contain only current data. As a database changes, out-of-date information, representing past states of the enterprise, is discarded. However, temporal support is a...
-
2014
Maani, Rouzbeh, Kalra, Sanjay, Yang, Yee-Hong
In this paper, we applied texture analysis to evaluate cerebral degeneration in amyotrophic lateral sclerosis (ALS). Two well-known methods, the gray level co-occurrence matrix (GLCM) and the gray level aura matrix (GLAM) were employed to extract texture features from routine T1 and T2 MR images....
-
1992
Technical report TR92-16. Recent proposals for semantics of default theories are all based on some types of weaker notion of extensions. This is typified in the well-founded semantics and the extension class semantics for default theories. Although these semantics solve the no-extension problem...
-
The APHID Parallel alpha-beta Search Algorithm
1996
Schaeffer, Jonathan, Brockington, Mark
Technical report TR96-07. This paper introduces the APHID (Asynchronous Parallel Hierarchical Iterative Deepening) game-tree search algorithm. An APHID search is a hierarchical search with a master controlling the top of the tree (d' ply), and the slaves searching the rest of the tree (d-d'...
-
2005
Technical report TR05-02. Assmann et al. [SIAM J. Alg. Disc. Meth., 2 (1981), 387-393] have shown that the bandwidth of caterpillars on n vertices with hairs of length at most two can be found in O(n log n) time and Monien [SIAM J. Alg. Disc. Meth., 7 (1986), 505-512] has shown that Bandwidth...
-
2012
Hu, W., Han, D., Hindle, Abram, Wong, K.
Android is an operating system designed specifically for mobile devices. It has a layered architecture. In this paper, we extract Android's concrete layered architecture by analyzing the build dependency relation between Android sub-projects and use it to validate the proposed conceptual...
-
1993
Manchak, Dennis W., van Beek, Peter
Technical report TR93-16. Many applications -- from planning and scheduling to problems in molecular biology -- rely heavily on a temporal reasoning component. In this paper, we discuss the design and an empirical analysis of algorithms for a temporal reasoning system based on Allen's...
-
1993
Technical report TR93-11. To meet the data management requirements of new complex applications, object management systems are emerging as the most likely candidate. The general acceptance of this new technology depends on the increased functionality it can provide, and one measurement is the...
-
The DIOM Approach to Large-scale Interoperable Database Systems
1995
Technical report TR95-16. A large-scale interoperable database system operating in a dynamic environment should provide a uniform access user interface to its components, scalability to larger networks, evolution of database schema and apllications, composability of client and server components,...
-
2013
Abou-Moustafa, Karim T., Kozyrskyj, Anita, Guttman, David, Scott, James, Yasui, Yutaka
Entropy measures of probability distributions are widely used measures in ecology, biology, genetics, and in other fields, to quantify species diversity of a community. Unfortunately, entropy–based diversity indices, or diversity indices for short, suffer from three problems. First, when...