Sciweavers

3874 search results - page 597 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
PR
2008
170views more  PR 2008»
15 years 3 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
ICRA
2010
IEEE
163views Robotics» more  ICRA 2010»
15 years 2 months ago
Exploiting domain knowledge in planning for uncertain robot systems modeled as POMDPs
Abstract— We propose a planning algorithm that allows usersupplied domain knowledge to be exploited in the synthesis of information feedback policies for systems modeled as parti...
Salvatore Candido, James C. Davidson, Seth Hutchin...
JMLR
2010
195views more  JMLR 2010»
15 years 2 months ago
Online Learning for Matrix Factorization and Sparse Coding
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statisti...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
154
Voted
ICMLA
2010
15 years 2 months ago
Ensembles of Neural Networks for Robust Reinforcement Learning
Reinforcement learning algorithms that employ neural networks as function approximators have proven to be powerful tools for solving optimal control problems. However, their traini...
Alexander Hans, Steffen Udluft
145
Voted
AAAI
2010
15 years 5 months ago
Efficient Belief Propagation for Utility Maximization and Repeated Inference
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
Aniruddh Nath, Pedro Domingos