1536 search results - page 45 / 308 » Approximately Dominating Representatives |
AAAI
2008
13 years 11 months ago
2008
We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and wh...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
CISS
2008
IEEE
14 years 3 months ago
2008
IEEE
—Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the...
DCOSS
2006
Springer
14 years 20 days ago
2006
Springer
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...
AAMAS
2007
Springer
13 years 9 months ago
2007
Springer
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...