4908 search results - page 88 / 982 » On the Complexity of Optimal K-Anonymity |
173
click to vote
WINE
2009
Springer
16 years 26 days ago
2009
Springer
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
175
click to vote
CIKM
2009
Springer
16 years 26 days ago
2009
Springer
In recent years, the tourism assistance community is gradually shifting its emphasis to digital, interactive systems. Our project aims for digital tourism assistance by combining ...
167
click to vote
IWPEC
2009
Springer
16 years 25 days ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
171
click to vote
GLOBECOM
2008
IEEE
16 years 22 days ago
2008
IEEE
— Recently, a maximum likelihood (ML) detection rule for differential unitary space time modulation (DUSTM) under the existence of unknown carrier frequency offset (CFO) has been...
195
click to vote
ICTAI
2008
IEEE
16 years 21 days ago
2008
IEEE
Unlike simple questions, complex questions cannot be answered by simply extracting named entities. These questions require inferencing and synthesizing information from multiple d...