3281 search results - page 502 / 657 » Bases for parametrized iterativity |
128
Voted
NIPS
1996
15 years 3 months ago
1996
Dynamic Programming, Q-learning and other discrete Markov Decision Process solvers can be applied to continuous d-dimensional state-spaces by quantizing the state space into an arr...
119
click to vote
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
126
click to vote
AAI
2007
15 years 2 months ago
2007
In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately with a single query...
107
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
116
click to vote
BMCBI
2006
15 years 1 months ago
2006
Background: Many DNA regulatory elements occur as multiple instances within a target promoter. Gibbs sampling programs for finding DNA regulatory elements de novo can be prohibiti...