1464 search results - page 174 / 293 » On optimal anonymization for l -diversity |
153
click to vote
CCCG
2008
15 years 8 months ago
2008
This paper builds a general mathematical and algorithmic theory for balloon-twisting structures, from balloon animals to balloon polyhedra, by modeling their underlying graphs (ed...
190
click to vote
NIPS
2008
15 years 8 months ago
2008
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
167
click to vote
NIPS
2008
15 years 8 months ago
2008
Prior work has shown that features which appear to be biologically plausible as well as empirically useful can be found by sparse coding with a prior such as a laplacian (L1) that...
192
click to vote
UAI
2008
15 years 7 months ago
2008
Continuous state spaces and stochastic, switching dynamics characterize a number of rich, realworld domains, such as robot navigation across varying terrain. We describe a reinfor...
181
click to vote
AIPS
2006
15 years 7 months ago
2006
Many scheduling problems are posed as optimization problems where the goal is to find a feasible schedule that maximizes the utilization of some resource. In some domains it is al...