4908 search results - page 888 / 982 » On the Complexity of Optimal K-Anonymity |
110
click to vote
MOBICOM
2003
ACM
15 years 5 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
SIGECOM
2003
ACM
15 years 5 months ago
2003
ACM
We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in propositional logic. Buying o...
CIAC
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
104
click to vote
IMR
2003
Springer
15 years 5 months ago
2003
Springer
Parameterizations of triangulated surfaces are used in an increasing number of mesh processing applications for various purposes. Although demands vary, they are often required to...