Sciweavers

3678 search results - page 106 / 736
» On the Stable Paths Problem
Sort
View
127
Voted
JCNS
2010
103views more  JCNS 2010»
14 years 10 months ago
Efficient computation of the maximum a posteriori path and parameter estimation in integrate-and-fire and more general state-spa
A number of important data analysis problems in neuroscience can be solved using state-space models. In this article, we describe fast methods for computing the exact maximum a pos...
Shinsuke Koyama, Liam Paninski
WWW
2009
ACM
16 years 4 months ago
General auction mechanism for search advertising
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
Dávid Pál, Gagan Aggarwal, Martin P&...
192
Voted
SIGMOD
2005
ACM
215views Database» more  SIGMOD 2005»
16 years 3 months ago
Nested intervals tree encoding in SQL
Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without acc...
Vadim Tropashko
154
Voted
JCP
2007
143views more  JCP 2007»
15 years 3 months ago
Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
Nicolas Chapados, Yoshua Bengio
120
Voted
MIG
2010
Springer
15 years 1 months ago
Path Planning for Groups Using Column Generation
In computer games, one or more groups of units need to move from one location to another as quickly as possible. If there is only one group, then it can be solved efficiently as a ...
Marjan van den Akker, Roland Geraerts, Han Hoogeve...