Sciweavers

777 search results - page 126 / 156
» Learning dynamic algorithm portfolios
Sort
View
ICML
2006
IEEE
16 years 3 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
ATAL
2008
Springer
15 years 4 months ago
On the usefulness of opponent modeling: the Kuhn Poker case study
The application of reinforcement learning algorithms to Partially Observable Stochastic Games (POSG) is challenging since each agent does not have access to the whole state inform...
Alessandro Lazaric, Mario Quaresimale, Marcello Re...
ML
2002
ACM
167views Machine Learning» more  ML 2002»
15 years 2 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
334
Voted
ICA
2012
Springer
13 years 10 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...
AAAI
2012
13 years 4 months ago
A Novel and Scalable Spatio-Temporal Technique for Ocean Eddy Monitoring
Swirls of ocean currents known as ocean eddies are a crucial component of the ocean’s dynamics. In addition to dominating the ocean’s kinetic energy, eddies play a significan...
James H. Faghmous, Yashu Chamber, Shyam Boriah, Fr...