Sciweavers

3643 search results - page 26 / 729
» Learning Submodular Functions
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Automatic shaping and decomposition of reward functions
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
Bhaskara Marthi
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 4 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
CIKM
2008
Springer
14 years 12 months ago
Representative entry selection for profiling blogs
Many applications on blog search and mining often meet the challenge of handling huge volume of blog data, in which one single blog could contain hundreds or even thousands of ent...
Jinfeng Zhuang, Steven C. H. Hoi, Aixin Sun, Rong ...
CORR
2010
Springer
109views Education» more  CORR 2010»
14 years 10 months ago
Hybrid tractability of soft constraint problems
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
Martin C. Cooper, Stanislav Zivný
EMMCVPR
2011
Springer
13 years 9 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko