Sciweavers

70 search results - page 10 / 14
» Fast computation of low rank matrix
Sort
View
ECCV
2002
Springer
14 years 11 months ago
Structure from Planar Motions with Small Baselines
We study the multi-frame structure from motion problem when the camera translates on a plane with small baselines and arbitrary rotations. This case shows up in many practical appl...
John Oliensis, René Vidal
JMLR
2012
12 years 7 days ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski
ICCAD
2005
IEEE
106views Hardware» more  ICCAD 2005»
14 years 3 months ago
Fast balanced stochastic truncation via a quadratic extension of the alternating direction implicit iteration
— Balanced truncation (BT) model order reduction (MOR) is known for its superior accuracy and computable error bounds. Balanced stochastic truncation (BST) is a particular BT pro...
Ngai Wong, Venkataramanan Balakrishnan
JCNS
2010
90views more  JCNS 2010»
13 years 4 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
SIGMETRICS
2000
ACM
105views Hardware» more  SIGMETRICS 2000»
14 years 2 months ago
Using the exact state space of a Markov model to compute approximate stationary measures
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algeb...
Andrew S. Miner, Gianfranco Ciardo, Susanna Donate...