4908 search results - page 337 / 982 » On the Complexity of Optimal K-Anonymity |
206
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
176
click to vote
NIPS
2007
15 years 8 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
200
click to vote
ICCV
2001
IEEE
16 years 8 months ago
2001
IEEE
We present a new technique that improves upon existing structure from motion (SFM) methods. We propose a SFM algorithm that is both recursive and optimal. Our method incorporates ...
166
click to vote
ICIP
2000
IEEE
16 years 8 months ago
2000
IEEE
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...
180
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, a novel design space exploration approach is proposed that enables a concurrent optimization of the topology, the process binding, and the communication routing of ...