Sciweavers

1991 search results - page 297 / 399
» Small Models of Large Machines
Sort
View
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 3 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
SIGIR
2010
ACM
15 years 1 months ago
Context-aware ranking in web search
The context of a search query often provides a search engine meaningful hints for answering the current query better. Previous studies on context-aware search were either focused ...
Biao Xiang, Daxin Jiang, Jian Pei, Xiaohui Sun, En...
FLAIRS
2006
14 years 11 months ago
Cognitive Simulation in Virtual Patients
We present an overview of the Virtual Patient project at the University of Maryland, which is developing a cognitive model of humans experiencing various states of health and dise...
Sergei Nirenburg, Marjorie McShane, Stephen Beale,...
CVPR
2012
IEEE
13 years 10 days ago
The use of on-line co-training to reduce the training set size in pattern recognition methods: Application to left ventricle seg
The use of statistical pattern recognition models to segment the left ventricle of the heart in ultrasound images has gained substantial attention over the last few years. The mai...
Gustavo Carneiro, Jacinto C. Nascimento
JMLR
2008
129views more  JMLR 2008»
14 years 10 months ago
Finite-Time Bounds for Fitted Value Iteration
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
Rémi Munos, Csaba Szepesvári