Sciweavers

153 search results - page 21 / 31
» On an equivalence in discrete extremal problems
Sort
View
UAI
2000
13 years 8 months ago
PEGASUS: A policy search method for large MDPs and POMDPs
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
Andrew Y. Ng, Michael I. Jordan
NA
2008
78views more  NA 2008»
13 years 6 months ago
A walk through energy, discrepancy, numerical integration and group invariant measures on measurable subsets of euclidean space
(A) The celebrated Gaussian quadrature formula on finite intervals tells us that the Gauss nodes are the zeros of the unique solution of an extremal problem. We announce recent re...
S. B. Damelin
JMLR
2010
145views more  JMLR 2010»
13 years 1 months ago
Parallelizable Sampling of Markov Random Fields
Markov Random Fields (MRFs) are an important class of probabilistic models which are used for density estimation, classification, denoising, and for constructing Deep Belief Netwo...
James Martens, Ilya Sutskever
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
13 years 11 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
COMPGEOM
2005
ACM
13 years 8 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg