Sciweavers

2570 search results - page 225 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
ICPR
2008
IEEE
15 years 10 months ago
Constrained clustering by a novel graph-based distance transformation
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
Kai Rothaus, Xiaoyi Jiang
JVCA
2008
112views more  JVCA 2008»
15 years 4 months ago
Constraint-based motion synthesis for deformable models
We present a fast goal-directed motion synthesis technique that integrates sample-based planning methods with constraint-based dynamics simulation using a finite element formulati...
William Moss, Ming C. Lin, Dinesh Manocha
142
Voted
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 25 days ago
SABRE: A Tool for Stochastic Analysis of Biochemical Reaction Networks
The importance of stochasticity within biological systems has been shown repeatedly during the last years and has raised the need for efficient stochastic tools. We present SABRE, ...
Frédéric Didier, Thomas A. Henzinger...
114
Voted
MICCAI
2005
Springer
16 years 5 months ago
A Fast-Marching Approach to Cardiac Electrophysiology Simulation for XMR Interventional Imaging
Cardiac ablation procedures are becoming more routine to treat arrhythmias. The development of electrophysiological models will allow investigation of treatment strategies. However...
Maxime Sermesant, Yves Coudière, Valé...
MICCAI
2005
Springer
16 years 5 months ago
Using the Fast Marching Method to Extract Curves with Given Global Properties
Abstract. Curves are often used as anatomical features to match surfaces that represent biological objects, such as the human brain. Automated and semi-automated methods for extrac...
Xiaodong Tao, Christos Davatzikos, Jerry L. Prince