4908 search results - page 140 / 982 » On the Complexity of Optimal K-Anonymity |
164
click to vote
ASPDAC
2001
ACM
15 years 10 months ago
2001
ACM
We propose a timing optimization technique for a complex finite state machine that consists of not only random logic but also data operators. In such a design, the timing critical...
155
click to vote
SIAMSC
2008
15 years 6 months ago
2008
A novel multilevel algorithm is presented for implementing the widely used linear sampling method in inverse obstacle scattering problems. The new method is shown to possess asympt...
138
click to vote
ECOOP
1998
Springer
15 years 10 months ago
1998
Springer
Framework optimizations capitalize on object dependencies, while framework flexibility and composability demand object independence. This paper shows how to balance these conflicti...
162
click to vote
PPSN
1994
Springer
15 years 10 months ago
1994
Springer
A general model for the coevolution of cooperating species is presented. This model is instantiated and tested in the domain of function optimization, and compared with a tradition...
161
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
— The design and analysis of capacity-approaching input signalling for optical intensity channels are presented. Both peak and average optical power constraints are considered in...