4908 search results - page 139 / 982 » On the Complexity of Optimal K-Anonymity |
158
click to vote
WSC
2007
15 years 8 months ago
2007
This paper describes an innovative framework, iFAOSimo, which integrates optimization, simulation and GIS (geographic information system) techniques to handle complex spatial faci...
214
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...
165
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper considers the decomposition of a complex matrix as the product of several sets of semi-unitary matrices and upper triangular matrices in iterative manner. The inner mos...
208
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We propose a low complexity analog joint source channel coding Multiple Description (MD) scheme for transmitting the symbols of a Gaussian source across a pair of independent AWGN...
144
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...