575 search results - page 6 / 115 » Computing Maximum Subsequence in Parallel |
ICPP
1994
IEEE
13 years 11 months ago
1994
IEEE
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
PPSN
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. The multiple sequence alignment problem (MSA) can be reformulated as the problem of finding a maximum weight trace in an alignment graph, which is derived from all pairw...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— In this paper, we consider the problem of how background knowledge about usual object arrangements can be utilized by a mobile robot to more efficiently find an object in an ...
ICPADS
2006
IEEE
14 years 1 months ago
2006
IEEE
Maximum likelihood (ML) estimation is used during tomosynthesis mammography reconstruction. A single reconstruction involves the processing of highresolution projection images, wh...
PPSN
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...