792 search results - page 56 / 159 » Finding Cost-Efficient Adapters |
BIBM
2009
IEEE
15 years 3 months ago
2009
IEEE
We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may conta...
FQAS
2006
Springer
15 years 3 months ago
2006
Springer
In focused XML retrieval, information retrieval systems have to find out which are the most appropriate retrieval units and return only these to the user, avoiding overlapping elem...
120
click to vote
AAAI
2000
15 years 1 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
EACL
2009
ACL Anthology
14 years 9 months ago
2009
ACL Anthology
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
ICPR
2006
IEEE
16 years 29 days ago
2006
IEEE
A new face recognition algorithm is presented. It supposes that a video sequence of a person is available both at enrollment and test time. During enrollment, a client Gaussian Mi...