2474 search results - page 345 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
143
click to vote
JGO
2010
14 years 11 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
161
click to vote
CVPR
2006
IEEE
16 years 7 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
147
click to vote
AB
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Haplotype inference from genotype data is a key computational problem in bioinformatics, since retrieving directly haplotype information from DNA samples is not feasible ...
134
click to vote
STOC
2010
ACM
16 years 2 months ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
123
Voted
EUROPAR
2004
Springer
15 years 10 months ago
2004
Springer
The APART working group is developing the APART Test Suite (ATS) for evaluating (automatic) performance analysis tools with respect to their correctness – that is, their ability...