Sciweavers

707 search results - page 18 / 142
» Solving path problems on the GPU
Sort
View
JCNS
2010
103views more  JCNS 2010»
14 years 6 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
MIG
2010
Springer
14 years 10 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...
109
Voted
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
14 years 9 months ago
Polynomial datapath optimization using constraint solving and formal modelling
For a variety of signal processing applications polynomials are implemented in circuits. Recent work on polynomial datapath optimization achieved significant reductions of hardware...
Finn Haedicke, Bijan Alizadeh, Görschwin Fey,...
CORR
1999
Springer
145views Education» more  CORR 1999»
14 years 11 months ago
Subgraph Isomorphism in Planar Graphs and Related Problems
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
David Eppstein
SAC
2010
ACM
15 years 6 months ago
Constraint-based LN-curves
We consider the design of parametric curves from geometric constraints such as distance from lines or points and tangency to lines or circles. We solve the Hermite problem with su...
Young Joon Ahn, Christoph M. Hoffmann