Search
Skip to Search Results- 10Zaiane, Osmar
- 5Nascimento, Mario
- 4Nascimento, Mario A.
- 3Oliveira, Stanley
- 3Ozsu, M. Tamer
- 2Antonie, Maria-Luiza
-
Inverted Matrix: Efficient Discovery of Frequent Items in Large Datasets in the Context of Interactive Mining
Download2003
El-Hajj, Mohammad, Zaiane, Osmar
Technical report TR03-08. Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. One major problem is the high memory dependency: either the gigantic data structure built is assumed to fit in main memory, or the recursive mining process...
-
2012
Kazemeyni, Fatemah, Owe, Olaf, Johnsen, Einar Broch, Balasingham, Ilangko, Nascimento, Mario A.
Technical report TR12-01. Limited energy supply is a chief concern when dealing with wireless sensor networks (WSNs). Thus, among other issues, routing protocols for WSNs should be designed with the goal of being energy efficient in the first place. For static networks this is already a...
-
2004
Antonie, Maria-Luiza, Zaiane, Osmar
Technical report TR04-07. Typical association rules consider only items enumerated in transactions. Such rules are referred to as positive association rules. Negative association rules also consider the same items, but in addition consider negated items (i.e. absent from transactions). Negative...
-
Modeling and Querying Multimedia Data
1998
Technical report TR98-05. Amidst the dramatic developments of computer technology in the last decades, we have seen a growing interest in supporting multimedia data. Compared with traditional data, the most noticeable features of multimedia data are their spatiality (the spatial layout of...
-
2009
Nikolaidis, Ioanis, Nascimento, Mario A., Malhotra, Baljeet
Technical report TR09-01. Finding the top-k values is an important type of aggregation query in wireless sensor networks. Previous proposals relied on a given underlying logical tree topology for data aggregation/forwarding, but did not pay due attention to the role of such topology. In this...
-
On the Trade-Off Between User-Location Privacy and Queried-Location Privacy in Wireless Sensor Networks
Download2009
Harms, Janelle, Vogt, Ryan, Nascimento, Mario
Technical report TR09-07. By eavesdropping on a user's query in a sensor network, an adversary can deduce both the user's location and his/her area of interest. In many domains it is desirable to guarantee privacy of both places. Relying on the principle of k-anonymity, we propose an effective...
-
2009
Alencar, Romulo, Nascimento, Mario, Brayner, Angelo
Technical report TR09-05. It is a well known fact that minimizing energy consumption in Wireless Sensor Networks (WSNs) is crucial for its usability; and minimizing the flow of data is one way to achieve that. Most WSN models assume the existence of a base station where query results could in...
-
1990
Technical report TR90-33. Object-oriented database systems have been proposed as an effective solution for providing the data management facilities of complex applications. Proving the veracity of this claim and the investigation of related issues such as query processing have been hampered by...
-
1995
Szafron, Duane, Ozsu, M. Tamer, Li, John
Technical report TR95-25. Declarative query languages are an important feature of database management systems and have played an important role in their success. As database management technology enters the multimedia information system area, the availability of special-purpose query languages...
-
1993
Lake, Robert, Schaeffer, Jonathan, Lu, Paul
Technical report TR93-13. Chess endgame databases, while of important theoretical interest, have yet to make a significant impact in tournament chess. In the game of checkers, however, endgame databases have played a pivotal role in the success of our World Championship challenger program...