Sciweavers

3630 search results - page 332 / 726
» Fast Marching Methods
Sort
View
161
Voted
EMNLP
2010
15 years 4 months ago
Hashing-Based Approaches to Spelling Correction of Personal Names
We propose two hashing-based solutions to the problem of fast and effective personal names spelling correction in People Search applications. The key idea behind our methods is to...
Raghavendra Udupa, Shaishav Kumar
AUTOMATICA
2011
15 years 1 months ago
Distributed dynamic programming for discrete-time stochastic control, and idempotent algorithms
Previously, idempotent methods have been found to be extremely fast for solution of dynamic programming equations associated with deterministic control problems. The original meth...
William M. McEneaney
JCNS
2010
103views more  JCNS 2010»
15 years 29 days 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
CVPR
2008
IEEE
16 years 8 months ago
Active microscopic cellular image annotation by superposable graph transduction with imbalanced labels
Systematic content screening of cell phenotypes in microscopic images has been shown promising in gene function understanding and drug design. However, manual annotation of cells ...
Jun Wang, Shih-Fu Chang, Xiaobo Zhou, Stephen T. C...
ICCV
2001
IEEE
16 years 8 months ago
Human Tracking with Mixtures of Trees
Tree-structured probabilistic models admit simple, fast inference. However, they are not well suited to phenomena such as occlusion, where multiple components of an object may dis...
Sergey Ioffe, David A. Forsyth