Sciweavers

6365 search results - page 310 / 1273
» Fast Local Computation Algorithms
Sort
View
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 6 months ago
Fast simulation of large-scale growth models
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle"...
Tobias Friedrich, Lionel Levine
MICCAI
2010
Springer
15 years 4 months ago
Fast Automatic Detection of Calcified Coronary Lesions in 3D Cardiac CT Images
Abstract. Even with the recent advances in multidetector computed tomography (MDCT) imaging techniques, detection of calcified coronary lesions remains a highly tedious task. Noise...
Sushil Mittal, Yefeng Zheng, Bogdan Georgescu, Fer...
ICCV
2007
IEEE
16 years 1 months ago
Monocular SLAM as a Graph of Coalesced Observations
We present a monocular SLAM system that avoids inconsistency by coalescing observations into independent local coordinate frames, building a graph of the local frames, and optimiz...
Ethan Eade, Tom Drummond
IPPS
2010
IEEE
15 years 4 months ago
Inter-block GPU communication via fast barrier synchronization
The graphics processing unit (GPU) has evolved from a fixedfunction processor with programmable stages to a programmable processor with many fixed-function components that deliver...
Shucai Xiao, Wu-chun Feng
WABI
2009
Springer
129views Bioinformatics» more  WABI 2009»
16 years 1 months ago
biRNA: Fast RNA-RNA Binding Sites Prediction
We present biRNA, a novel algorithm for prediction of binding sites between two RNAs based on minimization of binding free energy. Similar to RNAup approach [30], we assume the bin...
Hamidreza Chitsaz, Rolf Backofen, Süleyman Ce...