4908 search results - page 111 / 982 » On the Complexity of Optimal K-Anonymity |
145
click to vote
PPSN
2000
Springer
15 years 10 months ago
2000
Springer
Many bacteria carry gene complexes that code for a toxin-antidote pair, e.g. colicin systems. Such gene complexes can be advantageous for its host by killing competitor bacteria wh...
182
click to vote
ICCAD
1995
IEEE
15 years 10 months ago
1995
IEEE
The traditional algorithm of Stockmeyer for area minimization of slicing
oorplans has time (and space) complexity O(n2 ) in the worst case, or O(nlogn) for balanced slicing. For ...
156
click to vote
PLDI
1998
ACM
15 years 10 months ago
1998
ACM
Existing array region representation techniques are sensitive to the complexity of array subscripts. In general, these techniques are very accurate and efficient for simple subscr...
212
click to vote
ICDE
2012
IEEE
13 years 8 months ago
2012
IEEE
—Many companies now routinely run massive data analysis jobs – expressed in some scripting language – on large clusters of low-end servers. Many analysis scripts are complex ...
162
click to vote
VLDB
1997
ACM
15 years 10 months ago
1997
ACM
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...