4908 search results - page 6 / 982 » On the Complexity of Optimal K-Anonymity |
81
Voted
COMPLEXITY
2010
14 years 7 months ago
2010
In this paper we introduce the Partition Task problem class along with a complexity measure to evaluate its instances and a performance measure to quantify the ability of a system...
151
Voted
DEBS
2011
ACM
2011
ACM
DejaVu: a complex event processing system for pattern matching over live and historical data streams
14 years 1 months ago
This short paper provides an overview of the DejaVu complex event processing (CEP) system, with an emphasis on its novel architecture and query optimization techniques for correla...
GECCO
2009
Springer
14 years 7 months ago
2009
Springer
Cooperative approaches have proved to be very useful in evolutionary computation due to their ability to solve efficiently high-dimensional complex problems through the cooperatio...
120
click to vote
SIGECOM
2011
ACM
14 years 10 days ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Recent research has revealed that circularity (or, propriety) of complex random signals can be exploited in developing optimal signal processors. In this paper, a robust estimator...