Sciweavers

52 search results - page 5 / 11
» Improved Deletions in Dynamic Spatial Approximation Trees
Sort
View
JCNS
2010
90views more  JCNS 2010»
13 years 2 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
NIPS
2003
13 years 9 months ago
Applying Metric-Trees to Belief-Point POMDPs
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
ICALP
2007
Springer
14 years 2 months ago
An Optimal Decomposition Algorithm for Tree Edit Distance
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Ore...
CIIT
2004
13 years 9 months ago
Speeding up keyword search for search engines
In the current information age, the dominant method for information search is by providing few keywords to a search engine. Keyword search is currently one of the most important o...
Sanjay Baberwal, Ben Choi
JNS
2010
61views more  JNS 2010»
13 years 6 months ago
Validity and Failure of the Boltzmann Approximation of Kinetic Annihilation
This paper introduces a new method to show the validity of a continuum description for the deterministic dynamics of many interacting particles. Here the many particle evolution is...
Karsten Matthies, Florian Theil