314 search results - page 26 / 63 » Computing all Suboptimal Alignments in Linear Space |
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
Fine-grained parallel applications require all their processes to run simultaneously on distinct processors to achieve good efficiency. This is typically accomplished by space sl...
AUTOMATICA
2008
14 years 12 months ago
2008
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
CSR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...
82
Voted
IROS
2007
IEEE
15 years 6 months ago
2007
IEEE
— A new solution to the Simultaneous Localization and Modelling problem is presented. It is based on the stochastic search of solutions in the state space to the global localizat...
94
Voted
MICCAI
2005
Springer
16 years 18 days ago
2005
Springer
Many medical imaging applications require the computation of dense correspondence vector fields that match one surface with another. To avoid the need for a large set of manually-d...