Sciweavers

15033 search results - page 352 / 3007
» Complexity Theory and Algorithms
Sort
View
MST
2006
149views more  MST 2006»
15 years 7 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
UAI
1997
15 years 8 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
JSAC
1998
81views more  JSAC 1998»
15 years 6 months ago
Early Detection and Trellis Splicing: Reduced-Complexity Iterative Decoding
Abstract—The excellent bit error rate performance of new iterative decoding algorithms (e.g., turbodecoding) is achieved at the expense of a computationally burdensome decoding p...
Brendan J. Frey, Frank R. Kschischang
ICCV
1999
IEEE
16 years 9 months ago
The Hamilton-Jacobi Skeleton
The eikonal equation and variants of it are of significant interest for problems in computer vision and image processing. It is the basis for continuous versions of mathematical m...
Kaleem Siddiqi, Sylvain Bouix, Allen Tannenbaum, S...
VIS
2004
IEEE
170views Visualization» more  VIS 2004»
16 years 8 months ago
Guaranteed Quality Triangulation of Molecular Skin Surfaces
We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges resi...
Ho-Lun Cheng, Xinwei Shi