Sciweavers

514 search results - page 32 / 103
» On the Structure of Valiant's Complexity Classes
Sort
View
TVCG
2010
162views more  TVCG 2010»
13 years 7 months ago
Computing Robustness and Persistence for Images
—We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to a continuous function, we study the robustness of homology c...
Paul Bendich, Herbert Edelsbrunner, Michael Kerber
RECOMB
2009
Springer
14 years 9 months ago
Lifting Prediction to Alignment of RNA Pseudoknots
Prediction and alignment of RNA pseudoknot structures are NP-hard. Nevertheless, several efficient prediction algorithms by dynamic programming have been proposed for restricted cl...
Mathias Möhl, Rolf Backofen, Sebastian Will
VISUALIZATION
1992
IEEE
14 years 21 days ago
Display of Scientific Data Structures for Algorithm Visualization
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...
William L. Hibbard, Charles R. Dyer, Brian E. Paul
MICCAI
2000
Springer
14 years 6 days ago
Small Sample Size Learning for Shape Analysis of Anatomical Structures
We present a novel approach to statistical shape analysis of anatomical structures based on small sample size learning techniques. The high complexity of shape models used in medic...
Polina Golland, W. Eric L. Grimson, Martha Elizabe...
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 3 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret