Sciweavers

10602 search results - page 1987 / 2121
» Weakly Useful Sequences
Sort
View
JAIR
2006
157views more  JAIR 2006»
15 years 6 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...
PR
2008
218views more  PR 2008»
15 years 6 months ago
Automatic feature localisation with constrained local models
We present an efficient and robust method of locating a set of feature points in an object of interest. From a training set we construct a joint model of the appearance of each fe...
David Cristinacce, Timothy F. Cootes
ORL
2006
105views more  ORL 2006»
15 years 6 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
PRL
2006
221views more  PRL 2006»
15 years 6 months ago
Towards on-line saccade planning for high-resolution image sensing
This paper considers the problem of designing an active observer to plan a sequence of decisions regarding what target to look at, through a foveal-sensing action. We propose a fr...
Alberto Del Bimbo, Federico Pernici
SP
2008
IEEE
159views Security Privacy» more  SP 2008»
15 years 6 months ago
Inferring neuronal network connectivity from spike data: A temporal data mining approach
Abstract. Understanding the functioning of a neural system in terms of its underlying circuitry is an important problem in neuroscience. Recent developments in electrophysiology an...
Debprakash Patnaik, P. S. Sastry, K. P. Unnikrishn...
« Prev « First page 1987 / 2121 Last » Next »