Sciweavers

5214 search results - page 876 / 1043
» The Online Specialization Problem
Sort
View
DLOG
2008
15 years 6 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
NIPS
1996
15 years 5 months ago
Maximum Likelihood Blind Source Separation: A Context-Sensitive Generalization of ICA
In the square linear blind source separation problem, one must nd a linear unmixing operator which can detangle the result xi(t) of mixing n unknown independent sources si(t) thro...
Barak A. Pearlmutter, Lucas C. Parra
ICML
2010
IEEE
15 years 5 months ago
Inverse Optimal Control with Linearly-Solvable MDPs
We present new algorithms for inverse optimal control (or inverse reinforcement learning, IRL) within the framework of linearlysolvable MDPs (LMDPs). Unlike most prior IRL algorit...
Dvijotham Krishnamurthy, Emanuel Todorov
AMC
2010
175views more  AMC 2010»
15 years 4 months ago
An inexact parallel splitting augmented Lagrangian method for large system of linear equations
: Parallel iterative methods are powerful tool for solving large system of linear equations (LEs). The existing parallel computing research results are focussed mainly on sparse sy...
Zheng Peng, DongHua Wu
108
Voted
CORR
2010
Springer
111views Education» more  CORR 2010»
15 years 4 months ago
Submodular Maximization by Simulated Annealing
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
Shayan Oveis Gharan, Jan Vondrák