Search
Skip to Search Results- 14Nascimento, Mario
- 5Sander, Joerg
- 2Chitkara, Vishal
- 2Coman, Alexandru
- 2Falcao, Alexandre
- 2Malhotra, Baljeet
- 5Database Systems
- 2Color histograms
- 2Color-based image retrieval
- 2Communication Networks
- 2Content-based image retrieval
- 2Databases
-
2013
Nascimento, Mario, Wang, Zhiyu, MacGregor, Mike
Mobile objects can be equipped with sensors enabling them to collect data, as well as answer queries remotely and in real-time. For that, one needs to be able to effectively route queries from a base station to the queried object in an efficient way, i.e., with minimum energy-cost and/or minimum...
-
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...
-
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...
-
Finding non-Redundant, Statistically Significant Regions in High Dimensional Data: a Novel Approach to Projected and Subspace Clustering
Download2008
Moise, Gabriela, Sander, Joerg
Technical report TR08-03. Projected and subspace clustering algorithms search for clusters of objects in subsets of attributes. Projected clustering computes several disjoint clusters, plus outliers, so that each cluster exists in its own subset of attributes. Subspace clustering enumerates...
-
2008
Technical report TR08-09. Many clustering algorithms in particular hierarchical clustering algorithms do not scale-up well for large data-sets especially when using an expensive distance function. In this paper, we propose a novel approach to perform approximate clustering with high accuracy....
-
2008
Nikolaidis, Ioanis, Nascimento, Mario, Malhotra, Baljeet
Technical report TR08-02. We consider the problem of vehicle classification using acoustic signals captured within a sensor network. The sensors perform collaborative decision and/or data fusion in a distributed and energy efficient manner. We present a distributed cluster-based algorithm,...
-
2006
Nascimento, Mario, Coman, Alexandru, Sander, Joerg
Technical report TR06-24. Wireless sensor networks have received much attention recently. Given their autonomy, flexibility and large range of functionality, they can be used as an effective and discrete means for monitoring data in many domains. Typically the network autonomy implies a limited...
-
2005
Nascimento, Mario, Sander, Joerg, Coman, Alexandru
Technical report TR05-23. Wireless sensor networks are made of autonomous devices that are able to collect information, store it, process it and share it with other devices. Such framework can be used to efficiently query spatiotemporal data, e.g., for monitoring humidity and temperature levels...
-
2004
Sander, Joerg, Moise, Gabriela, Rafiei, Davood
Technical report TR04-24. This thesis studies the problem of effectively finding related pages on the Web, where given the URL of a page, one wants to find other pages that are on the same topic. This is a both simple and natural way of searching for resources without being forced to formulate a...