4908 search results - page 98 / 982 » On the Complexity of Optimal K-Anonymity |
229
click to vote
CC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
183
click to vote
DMSN
2010
ACM
15 years 4 months ago
2010
ACM
Complex event processing (CEP) has become increasingly important for tracking and monitoring applications ranging from health care, supply chain management to surveillance. These ...
158
click to vote
ICASSP
2008
IEEE
16 years 25 days ago
2008
IEEE
The desirable asymptotic optimality properties of the maximum likelihood (ML) estimator make it an attractive solution for performing independent component analysis (ICA) as well....
207
click to vote
DLOG
2006
15 years 7 months ago
2006
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...
177
click to vote
AAAI
1993
15 years 7 months ago
1993
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...