Sciweavers

1279 search results - page 97 / 256
» Fast Implementations of Automata Computations
Sort
View
KRMED
2008
13 years 11 months ago
Exploiting Fast Classification of SNOMED CT for Query and Integration of Health Data
By constructing local extensions to SNOMED we aim to enrich existing medical and related data stores, simplify the expression of complex queries, and establish a foundation for se...
Michael Lawley
AAAI
2006
13 years 11 months ago
Fast SAT-based Answer Set Solver
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
Zhijun Lin, Yuanlin Zhang, Hector Hernandez
DAGM
2010
Springer
13 years 11 months ago
3D Object Detection Using a Fast Voxel-Wise Local Spherical Fourier Tensor Transformation
In this paper we present a novel approach for expanding spherical 3D-tensor fields of arbitrary order in terms of a tensor valued local Fourier basis. For an efficient implementati...
Henrik Skibbe, Marco Reisert, Thorsten Schmidt, Kl...
CMPB
2010
152views more  CMPB 2010»
13 years 10 months ago
Fast free-form deformation using graphics processing units
A large number of algorithms have been developed to perform non-rigid registration and it is a tool commonly used in medical image analysis. The FreeForm Deformation algorithm is ...
Marc Modat, Gerard R. Ridgway, Zeike A. Taylor, Ma...
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