1421 search results - page 73 / 285 » Algorithms for subsequence combinatorics |
110
click to vote
BMCBI
2008
15 years 3 months ago
2008
Background: Liquid chromatography coupled to mass spectrometry (LC/MS) is an important analytical technology for e.g. metabolomics experiments. Determining the boundaries, centres...
115
click to vote
CADE
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound meth...
139
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We introduce a new technique to bound the asymptotic performance of splay trees. The basic idea is to transcribe, in an indirect fashion, the rotations performed by the splay tree...
117
click to vote
AAAI
1998
15 years 4 months ago
1998
The problem of concurrent mapping and localization has received considerable attention in the mobile robotics community. Existing approachescan largely be grouped into two distinc...
117
click to vote
COCOON
2009
Springer
15 years 9 months ago
2009
Springer
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...