Sciweavers

7930 search results - page 1265 / 1586
» Greedy in Approximation Algorithms
Sort
View
ICML
2009
IEEE
16 years 7 months ago
Binary action search for learning continuous-action control policies
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...
Jason Pazis, Michail G. Lagoudakis
ICML
2008
IEEE
16 years 7 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
ICML
1999
IEEE
16 years 7 months ago
Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
Sebastian Thrun, John Langford, Dieter Fox
SIGSOFT
2005
ACM
16 years 6 months ago
Performance data collection using a hybrid approach
Performance profiling consists of monitoring a software system during execution and then analyzing the obtained data. There are two ways to collect profiling data: event tracing t...
Edu Metz, Raimondas Lencevicius, Teofilo F. Gonzal...
ISBI
2006
IEEE
16 years 6 months ago
3D tumor shape reconstruction from 2D bioluminescence images
This paper introduces a novel and efficient algorithm for reconstructing the 3D shapes of tumors from a set of 2D bioluminescence images which are taken by the same camera but aft...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas,...
« Prev « First page 1265 / 1586 Last » Next »