4908 search results - page 782 / 982 » On the Complexity of Optimal K-Anonymity |
148
click to vote
TACAS
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
225
click to vote
TCGOV
2005
Springer
16 years 1 days ago
2005
Springer
Growing complexity of the data and processes to be managed, as well as the transition from strict governmental regulation towards autonomy make academic institutions a significant ...
210
click to vote
GECCO
2005
Springer
16 years 18 hour ago
2005
Springer
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
183
click to vote
DIALM
2004
ACM
16 years 5 hour ago
2004
ACM
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
163
click to vote
ISPD
2004
ACM
16 years 4 hour ago
2004
ACM
This paper describes the structured ASIC technology and impacts to the implementation flow. With an optimized and programmable structure, the structured ASIC technology indeed int...