2089 search results - page 285 / 418 » A New Problem in String Searching |
104
click to vote
RECOMB
1998
Springer
15 years 2 months ago
1998
Springer
Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching...
141
click to vote
SIGCOMM
1997
ACM
15 years 2 months ago
1997
ACM
Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP...
FGR
2004
IEEE
15 years 1 months ago
2004
IEEE
We consider the problem of robustly and accurately locating facial features. The relative positions of different feature points are represented using a statistical shape model. We...
107
click to vote
GCB
2004
Springer
15 years 1 months ago
2004
Springer
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
ECML
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In this paper, we propose a new method for learning to rank. `Ranking SVM' is a method for performing the task. It formulizes the problem as that of binary classific...