4908 search results - page 112 / 982 » On the Complexity of Optimal K-Anonymity |
158
click to vote
JMLR
2010
15 years 1 months ago
2010
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
196
click to vote
AGI
2011
14 years 10 months ago
2011
We present an actor-critic scheme for reinforcement learning in complex domains. The main contribution is to show that planning and I/O dynamics can be separated such that an intra...
202
click to vote
COR
2011
2011
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
15 years 1 months ago
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
237
click to vote
JMLR
2010
15 years 1 months ago
2010
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
212
click to vote
SAB
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this work, we are interested in understanding how emotional interactions with a social partner can bootstrap increasingly complex behaviors such as social referencing....