4908 search results - page 191 / 982 » On the Complexity of Optimal K-Anonymity |
199
click to vote
SSPR
2004
Springer
15 years 12 months ago
2004
Springer
This paper presents an optimized Hill Climbing algorithm to select a subset of features for handwritten character recognition. The search is conducted taking into account a random ...
159
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
The discrete multitone (DMT)transceivers have enjoyed great success in high speed data transmission. It is known that when the cyclicprefix is no shorterthan the channel impulse r...
161
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— A broad class of problems in circuits, electromagnetics, and optics can be expressed as finding some parameters of a linear system with a specific type. This paper is...
169
click to vote
PLDI
1999
ACM
15 years 11 months ago
1999
ACM
Previous selective dynamic compilation systems have demonstrated that dynamic compilation can achieve performance improvements at low cost on small kernels, but they have had diff...
169
click to vote
VLSID
1999
IEEE
15 years 10 months ago
1999
IEEE
We describe an improved iterationless approach for computing the effective capacitance of an interconnect load at a driving gate output. The speed and accuracy of our approach mak...