1088 search results - page 12 / 218 » A Bayesian Approach to Tackling Hard Computational Problems |
COMPGEOM
2010
ACM
14 years 16 days ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
BMCBI
2007
13 years 7 months ago
2007
Background: Answers to several fundamental questions in statistical genetics would ideally require knowledge of the ancestral pedigree and of the gene flow therein. A few examples...
CVPR
2001
IEEE
14 years 9 months ago
2001
IEEE
This paper proposes a new Bayesian framework for solving the matting problem, i.e. extracting a foreground element from a background image by estimating an opacity for each pixel ...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
The Negative Slope Coefficient (nsc) is an empirical measure of problem hardness based on the analysis of offspring-fitness vs. parent-fitness scatterplots. The nsc has been teste...
CC
2002
Springer
13 years 7 months ago
2002
Springer
We show that for several natural classes of "structured" matrices, including symmetric, circulant, Hankel and Toeplitz matrices, approximating the permanent modulo a prim...