4908 search results - page 798 / 982 » On the Complexity of Optimal K-Anonymity |
147
click to vote
ISSRE
2000
IEEE
15 years 11 months ago
2000
IEEE
Data from several projects show a significant relationship between the size of a module and its defect density. Here we address implications of this observation. Does the overall ...
189
click to vote
ITCC
2000
IEEE
15 years 11 months ago
2000
IEEE
In multiuser communication, the receiver’s performance is degraded by multiuser interference (MUI) as well as multipath distortions. This paper aims at elimination of these side...
170
click to vote
RTCSA
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
150
click to vote
ATAL
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Recent research has provided methods for coordinating the individually formed concurrent hierarchical plans (CHiPs) of a group of agents in a shared environment. A reason...
167
click to vote
ICFP
1999
ACM
15 years 11 months ago
1999
ACM
Run-time type dispatch enables a variety of advanced optimization techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, and fla...