359 search results - page 70 / 72 » The Parameterized Complexity of Counting Problems |
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Many computer vision and image processing tasks require the preservation of local discontinuities, terminations and bifurcations. Denoising with feature preservation is a challeng...
LPNMR
2007
Springer
14 years 1 months ago
2007
Springer
Logic programming under the answer-set semantics nowadays deals with numerous different notions of equivalence between programs. This is due to the fact that equivalence for substi...
SPRINGSIM
2007
13 years 8 months ago
2007
— Stochastic activity networks (SANs) are a widely used formalism for describing complex systems that have random behavior. Sophisticated software tools exist for the modeling an...
BMCBI
2010
13 years 7 months ago
2010
Background: Mass spectrometry (MS) is an essential analytical tool in proteomics. Many existing algorithms for peptide detection are based on isotope template matching and usually...
FOCM
2008
13 years 7 months ago
2008
We consider the problem of finding a singularity of a differentiable vector field X defined on a complete Riemannian manifold. We prove a unified result for the existence and local...