Sciweavers

276 search results - page 13 / 56
» Fast Algorithm for Stochastic Tree Computation
Sort
View
CSB
2005
IEEE
114views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Fa...
ICPR
2002
IEEE
14 years 8 months ago
Fast Extraction of Tubular and Tree 3D Surfaces with Front Propagation Methods
We present a new fast approach for surface segmentation of thin structures, like vessels and vascular trees, based on Fast Marching and Level Sets methods. Fast Marching allows se...
Thomas Deschamps, Laurent D. Cohen
AAAI
2011
12 years 7 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
CVPR
2010
IEEE
14 years 4 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff
SGP
2004
13 years 10 months ago
Two Algorithms for Fast Reclustering of Dynamic Meshed Surfaces
Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two no...
Nathan A. Carr, John C. Hart