Sciweavers

1554 search results - page 194 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
ICMCS
2006
IEEE
113views Multimedia» more  ICMCS 2006»
15 years 9 months ago
Fast Multi-Reference Frame Motion Estimation via Downhill Simplex Search
Multi-reference frame motion estimation improves the accuracy of motion compensation in video compression, but it also dramatically increases computational complexity. Based on tr...
Chen-Kuo Chiang, Shang-Hong Lai
COLT
2004
Springer
15 years 7 months ago
The Budgeted Multi-armed Bandit Problem
straction of the following scenarios: choosing from among a set of alternative treatments after a fixed number of clinical trials, determining the best parameter settings for a pro...
Omid Madani, Daniel J. Lizotte, Russell Greiner
CORR
2011
Springer
183views Education» more  CORR 2011»
14 years 10 months ago
Mean-Variance Optimization in Markov Decision Processes
We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomiz...
Shie Mannor, John N. Tsitsiklis
JMLR
2010
99views more  JMLR 2010»
14 years 10 months ago
An Efficient Explanation of Individual Classifications using Game Theory
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...
Erik Strumbelj, Igor Kononenko
ICML
2009
IEEE
16 years 4 months ago
Learning with structured sparsity
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
Junzhou Huang, Tong Zhang, Dimitris N. Metaxas