Search
Skip to Search Results- 10Zaiane, Osmar
- 5Nascimento, Mario
- 4Nascimento, Mario A.
- 3Oliveira, Stanley
- 3Ozsu, M. Tamer
- 2Antonie, Maria-Luiza
-
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 ...
-
Content-Based Image Retrieval Using Binary Signatures
2000
Nascimento, Mario, Chitkara, Vishal, Mastaller, Curt
Technical report TR00-18. Significant research has focused on determining efficient methodologies for retrieving images in large image databases. In this paper, we propose two variations of a new image abstraction technique based on signature bit-strings and an appropriate similarity metric. The...
-
2010
Renz, Matthias, Kriegel, Hans-Peter, Nascimento, Mario A., Follmann, Anna, Kroeger, Peer, Zuefle, Andreas
Technical report TR10-09. Count queries in wireless sensor networks report the number of sensor nodes for which the measured values satisfy a given query predicate. However, measurements in wireless sensor networks are typically imprecise due to limited accuracy of the sensor hardware or...
-
2002
Lee, Chi-Hoon, Foss, Andrew, Zaiane, Osmar, Wang, Weinan
Technical report TR02-03. Clustering is the problem of grouping data based on similarity and consists of maximizing the intra-group similarity while minimizing the iter-group similarity. While this problem has attracted the attention of many researchers for many years, we are witnessing a...
-
2010
Niedermayer, Johannes, Nascimento, Mario A., Kroeger, Peer, Kriegel, Hans-Peter, Renz, Matthias
Technical report TR10-03. Top-k queries are a popular type of query in Wireless Sensor Networks. Typical solutions rely on coordinated root-to-nodes and nodes-to-root messages and on maintaining filters at the nodes, aiming at suppressing unnecessary messages, hence saving energy and furthering...
-
2001
Lu, Paul, El-Hajj, Mohammad, Zaiane, Osmar
Technical report TR01-12. Searching for frequent patterns in transactional databases is considered one of the most important data mining problems. Most current association mining algorithms, whether sequential or parallel, adopt an apriori-like algorithm that requires full multiple I/O scans of...
-
2003
Oliveira, Stanley, Zaiane, Osmar
Technical report TR03-12. Despite its benefit in a wide range of applications, data mining techniques also have raised a number of ethical issues. Some such issues include those of privacy, data security, intellectual property rights, and many others. In this paper, we address the privacy problem...
-
2011
Nascimento, Mario A, Ammar, Khaled
Technical report TR11-03. Wireless Sensor Networks (WSNs) are typically used to collect values of some phenomena in a monitored area. In many applications, users are interested in summaries of the observed data, e.g., a histogram reflecting the distribution of the collected values. However,...