2474 search results - page 288 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
142
Voted
FOCS
2008
IEEE
16 years 24 days ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. â€...
208
click to vote
JEI
2006
15 years 6 months ago
2006
In this paper, we show how Markovian strategies used to solve well-known segmentation problems such as motion estimation, motion detection, motion segmentation, stereovision, and c...
183
click to vote
IPPS
2006
IEEE
16 years 11 days ago
2006
IEEE
Protein sequences with unknown functionality are often compared to a set of known sequences to detect functional similarities. Efficient dynamic programming algorithms exist for t...
184
click to vote
IJIT
2004
15 years 7 months ago
2004
One of the major problems in genomic field is to perform sequence comparison on DNA and protein sequences. Executing sequence comparison on the DNA and protein data is a computatio...
152
click to vote
CLEIEJ
2002
15 years 6 months ago
2002
Advances in parallel computation are of central importance to Artificial Intelligence due to the significant amount of time and space their programs require. Functional languages ...