Sciweavers

824 search results - page 58 / 165
» Weighted Low-Rank Approximations
Sort
View
CDC
2009
IEEE
189views Control Systems» more  CDC 2009»
15 years 2 months ago
Dirac mixture approximation of multivariate Gaussian densities
— For the optimal approximation of multivariate Gaussian densities by means of Dirac mixtures, i.e., by means of a sum of weighted Dirac distributions on a continuous domain, a n...
Uwe D. Hanebeck, Marco F. Huber, Vesa Klumpp
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
15 years 2 months ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...
AAAI
2010
14 years 11 months ago
Reinforcement Learning via AIXI Approximation
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian...
Joel Veness, Kee Siong Ng, Marcus Hutter, David Si...
CORR
2010
Springer
104views Education» more  CORR 2010»
14 years 10 months ago
Approximating the minimum directed tree cover
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
Viet Hung Nguyen
FOCS
2008
IEEE
15 years 4 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak