Search
Skip to Search Results- 10Zaiane, Osmar
- 5Nascimento, Mario
- 4Nascimento, Mario A.
- 3Bowling, Michael
- 3Oliveira, Stanley
- 3Schaeffer, Jonathan
-
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...
-
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...
-
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...
-
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...
-
2012
Lanctot, Marc, Gibson, Richard, Burch, Neil, Szafron, Duane
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. While the base algorithm performs a full tree traversal on each iteration, Monte Carlo CFR (MCCFR) reduces the per...
-
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...
-
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,...
-
2004
Cutumisu, M., McNaughton, M., Parker, D., Schaeffer, Jonathan, Redford, J., Szafron, Duane
Technical report TR04-05. Recently, some researchers have argued that generative design patterns (GDPs) can leverage the obvious design re-use that characterizes traditional design patterns into code re-use. This paper provides additional evidence that GDPs are both useful and productive. ...
-
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...