1242 search results - page 103 / 249 » A Computational Complexity Theory in Membrane Computing |
ALDT
2009
Springer
15 years 4 months ago
2009
Springer
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
COMPGEOM
2003
ACM
15 years 3 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
AC
2004
Springer
14 years 10 months ago
2004
Springer
Shotgun sequencing is the most widely used technique for determining the DNA sequence of organisms. It involves breaking up the DNA into many small pieces that can be read by auto...
118
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We introduce a novel data-driven mean-shift belief propagation
(DDMSBP) method for non-Gaussian MRFs, which
often arise in computer vision applications. With the aid
of scale sp...
STACS
2000
Springer
15 years 1 months ago
2000
Springer
We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin ...