4908 search results - page 227 / 982 » On the Complexity of Optimal K-Anonymity |
191
click to vote
NAACL
2001
15 years 8 months ago
2001
Developing dialogue systems is a complex process. In particular, designing efficient dialogue management strategies is often difficult as there are no precise guidelines to develo...
175
click to vote
EUROPAR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. To resolve difficulties in parallel programming, a large number of studies are conducted on parallel skeletons and optimization theorems over skeleton programs. However, ...
150
Voted
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
Predictive coding eliminates redundancy due to correlations between the current and past signal samples, so that only the innovation, or prediction residual, needs to be encoded. ...
160
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We consider an information-theoretic objective function for statistical modeling of time series that embodies a parametrized trade-off between the predictive power of a model and...
182
click to vote
IS
2007
15 years 6 months ago
2007
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...