4908 search results - page 818 / 982 » On the Complexity of Optimal K-Anonymity |
192
click to vote
NIPS
2008
15 years 8 months ago
2008
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
175
click to vote
NIPS
2008
15 years 8 months ago
2008
In kernel-based regression learning, optimizing each kernel individually is useful when the data density, curvature of regression surfaces (or decision boundaries) or magnitude of...
170
click to vote
ISCAPDCS
2007
15 years 8 months ago
2007
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
168
click to vote
SIMUTOOLS
2008
15 years 8 months ago
2008
This paper presents an approach to simulate complex hierarchical process chains resulting from large logistics networks in OMNeT++, a discrete event simulation environment designe...
170
click to vote
SEBD
2007
15 years 8 months ago
2007
We consider the problem of query containment over an object data model derived from F-logic. F-logic has generated considerable interest commercially, in the academia, and within ...