Sciweavers

1261 search results - page 14 / 253
» Approximation algorithms for aligning points
Sort
View
JAIR
2006
160views more  JAIR 2006»
14 years 9 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
ICBA
2004
Springer
271views Biometrics» more  ICBA 2004»
15 years 3 months ago
Enhance the Alignment Accuracy of Active Shape Models Using Elastic Graph Matching
Active Shape Model (ASM) is one of the most popular methods for image alignment. To improve its matching accuracy, in this paper, ASM searching method is combined with a simplifie...
Sanqiang Zhao, Wen Gao, Shiguang Shan, Baocai Yin
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 1 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
BMCBI
2005
158views more  BMCBI 2005»
14 years 9 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
JCC
2008
88views more  JCC 2008»
14 years 9 months ago
A self-organizing algorithm for molecular alignment and pharmacophore development
Abstract: We present a method for simultaneous three-dimensional (3D) structure generation and pharmacophorebased alignment using a self-organizing algorithm called Stochastic Prox...
Deepak Bandyopadhyay, Dimitris K. Agrafiotis