4908 search results - page 787 / 982 » On the Complexity of Optimal K-Anonymity |
198
click to vote
ITS
2004
Springer
15 years 12 months ago
2004
Springer
This research describes a probabilistic approach for developing predictive models of how students learn problem-solving skills in general qualitative chemistry. The goal is to use ...
191
click to vote
IWPEC
2004
Springer
15 years 12 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
173
click to vote
PAKDD
2004
ACM
15 years 12 months ago
2004
ACM
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
218
click to vote
SCOPES
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
181
click to vote
SCOPES
2004
Springer
15 years 12 months ago
2004
Springer
An automated framework for code and data partitioning for the needs of data management is presented. The goal is to identify the main data types from the data management perspectiv...