4908 search results - page 126 / 982 » On the Complexity of Optimal K-Anonymity |
214
click to vote
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
134
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
Recent theoretical results have shown that improved bounds on generalization error of classifiers can be obtained by explicitly taking the observed margin distribution of the trai...
185
click to vote
ISSAC
2004
Springer
15 years 11 months ago
2004
Springer
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...
154
click to vote
ICC
2007
IEEE
16 years 22 days ago
2007
IEEE
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...
200
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a singl...