Sciweavers

1176 search results - page 198 / 236
» Sparse reward processes
Sort
View
PAMI
2011
13 years 5 months ago
Action Recognition Using Mined Hierarchical Compound Features
—The field of Action Recognition has seen a large increase in activity in recent years. Much of the progress has been through incorporating ideas from single frame object recogn...
Andrew Gilbert, John Illingworth, Richard Bowden
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
12 years 1 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
ICML
1996
IEEE
14 years 11 months ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore
QEST
2005
IEEE
14 years 4 months ago
iLTLChecker: A Probabilistic Model Checker for Multiple DTMCs
iLTL is a probabilistic temporal logic that can specify properties of multiple discrete time Markov chains (DTMCs). In this paper, we describe two related tools: MarkovEstimator a...
YoungMin Kwon, Gul A. Agha
CVPR
2009
IEEE
15 years 5 months ago
Co-training with Noisy Perceptual Observations
Many perception and multimedia indexing problems involve datasets that are naturally comprised of multiple streams or modalities for which supervised training data is only sparsely...
Ashish Kapoor, Chris Mario Christoudias, Raquel Ur...