4908 search results - page 645 / 982 » On the Complexity of Optimal K-Anonymity |
159
click to vote
ATAL
2003
Springer
16 years 2 days ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
180
click to vote
DAWAK
2003
Springer
16 years 1 days ago
2003
Springer
View materialization is recognized to be one of the most effective ways to increase the Data Warehouse performance; nevertheless, due to the computational complexity of the techniq...
134
click to vote
ERSHOV
2003
Springer
16 years 1 days ago
2003
Springer
Despite practical successes with the Futamura projections, it has been an open question whether target programs produced by specializing interpreters can always be as efficient as ...
159
click to vote
EUROGP
2003
Springer
16 years 1 days ago
2003
Springer
Test programs are fragment of code, but, unlike ordinary application programs, they are not intended to solve a problem, nor to calculate a function. Instead, they are supposed to ...
159
click to vote
GECCO
2003
Springer
16 years 1 days ago
2003
Springer
The purpose of this study is to explore an alternative means of hand image classification, one that requires minimal human intervention. The main tool for accomplishing this is a G...