4908 search results - page 81 / 982 » On the Complexity of Optimal K-Anonymity |
144
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
214
click to vote
TWC
2010
15 years 29 days ago
2010
This paper proposes a framework for distributed sequential parameter estimation in wireless sensor networks. In the proposed scheme, the estimator is updated sequentially at the c...
173
click to vote
PAKDD
2001
ACM
15 years 10 months ago
2001
ACM
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
141
click to vote
ICMCS
2005
IEEE
15 years 12 months ago
2005
IEEE
We study the problem of rate-distortion optimal packetization with uneven erasure protection (UEP) of scalable source sequence, into multiple groups of packets. The grouping of pa...
145
click to vote
IJACTAICIT
2010
15 years 3 months ago
2010
In this article, a hybrid optimization method has been proposed consisting of modified ant colony systems (ACSs) and constrained nonlinear programming (NLP) to solve the problems ...