Search
Skip to Search Results- 10Zaiane, Osmar
- 5Nascimento, Mario
- 4Nascimento, Mario A.
- 3Oliveira, Stanley
- 2Antonie, Maria-Luiza
- 2El-Hajj, Mohammad
- 29Computing Science, Department of
- 29Computing Science, Department of/Technical Reports (Computing Science)
- 4Graduate and Postdoctoral Studies (GPS), Faculty of
- 4Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
- 1WISEST Summer Research Program
- 1WISEST Summer Research Program/WISEST Research Posters
-
2002
Oliveira, Stanley, Zaiane, Osmar
Technical report TR02-13. Discovering hidden patterns from large amounts of data plays an important role in marketing, business, medical analysis, and other applications where these patterns are paramount for strategic decision making. However, recent research has shown that some discovered...
-
A Generic Type System for an Object-Oriented Multimedia Database System
1996
Technical report TR96-14. This Technical Report is based upon an M.Sc. thesis in the Department of Computing Science at the University of Alberta. It describes the design of a generic multimedia database system that supports a wide class of documents. The design is characterized by an...
-
2009
Malhotra, Baljeet, Nikolaidis, Ioanis, Nascimento, Mario
Technical report TR09-14. We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommodates transmission dependencies that allow in-network aggregation to be performed. We formulate the...
-
Spring 2013
Each individual chromatogram is typically very sparse, especially when coupled with a technique such as mass spectrometry. Only a small portion of the recorded data actually contains potentially useful information. Since the inclusion of irrelevant information will have detrimental effects upon...
-
An Efficient One-Scan Sanitization For Improving The Balance Between Privacy And Knowledge Discovery
Download2003
Oliveira, Stanley, Zaiane, Osmar
Technical report TR03-15. In this paper, we address the problem of protecting some sensitive knowledge in transactional databases. The challenge is on protecting actionable knowledge for strategic decisions, but at the same time not losing the great benefit of association rule mining. To...
-
1994
Goralwalla, Iqbal, Ozsu, M. Tamer, Tansel, Abdullah
Technical report TR94-15. In this paper we describe an implementation of a temporal relational database management system based on attribute timestamping. For this purpose we modify an existing software which supports set-valued attributes. The algebraic language of the system includes...
-
An Immersed Virtual Environment for Data WarehouseVisualization: Challenges and Implementation
Download2000
Technical report TR00-17. A system, DIVE-ON, was developed for visualizing and interacting with data from distributed data warehouses in an immersed virtual reality environment called a CAVE. The system provides navigation operations, OLAP manipulations, and data selection and filtering...
-
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...
-
1992
Ghose, Aditya, Geobel, Randy, Yuan, Li-Yan
Technical report TR92-09. In many database applications, designers can easily provide at least some information about the relative importance of the information to be stored and manipulated. While of potentially high value, the ordering information is typically only partial. Here we address the...
-
Benchmarking Access Structures for High-Dimensional Multimedia Data
1999
Nascimento, Mario, Colossi, Nathan
Technical report TR99-05. In multimedia databases it is usual to map objects into feature vectors in high-dimensional spaces. In order to speed query processing access structures, or indices, are required. Unfortunately, in the case of similarity queries, which are in fact nearest neighbor ...