4908 search results - page 815 / 982 » On the Complexity of Optimal K-Anonymity |
162
click to vote
ESWS
2008
Springer
15 years 8 months ago
2008
Springer
The goal of this paper is to give an overview of the basics of the theory of RDF databases. We provide a formal definition of RDF that includes the features that distinguish this m...
193
click to vote
ICDM
2007
IEEE
15 years 8 months ago
2007
IEEE
An easily implementable mixed-integer algorithm is proposed that generates a nonlinear kernel support vector machine (SVM) classifier with reduced input space features. A single ...
208
click to vote
FORMATS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
166
click to vote
FSE
2008
Springer
15 years 8 months ago
2008
Springer
At Crypto 2007, Joux and Peyrin showed that the boomerang attack, a classical tool in block cipher cryptanalysis, can also be very useful when analyzing hash functions. They applie...
183
click to vote
AAAI
2010
15 years 8 months ago
2010
Recent advancements in model-based reinforcement learning have shown that the dynamics of many structured domains (e.g. DBNs) can be learned with tractable sample complexity, desp...