Sciweavers

422 search results - page 11 / 85
» Generalizations of small profinite structures
Sort
View
CPM
2008
Springer
154views Combinatorics» more  CPM 2008»
13 years 9 months ago
Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...
Mathias Möhl, Sebastian Will, Rolf Backofen
COMBINATORICS
2004
243views more  COMBINATORICS 2004»
13 years 7 months ago
Class-Uniformly Resolvable Group Divisible Structures II: Frames
We consider Class-Uniformly Resolvable frames (CURFs), which are group divisible designs with partial resolution classes subject to the class-uniform condition. We derive the nece...
Peter Danziger, Brett Stevens
TMI
1998
122views more  TMI 1998»
13 years 7 months ago
Segmentation and Interpretation of MR Brain Images: An Improved Active Shape Model
Abstract— This paper reports a novel method for fully automated segmentation that is based on description of shape and its variation using point distribution models (PDM’s). An...
Nicolae Duta, Milan Sonka
COMPGEOM
2003
ACM
14 years 18 days ago
The smallest enclosing ball of balls: combinatorial structure and algorithms
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Kaspar Fischer, Bernd Gärtner
ICPR
2004
IEEE
14 years 8 months ago
Towards Surface Regularization via Medial Axis Transitions
The reconstruction of objects from data in practical applications often leads to surfaces with small perturbations and other artifacts which make the detection of their ridges and...
Frederic F. Leymarie, Benjamin B. Kimia, Peter J. ...