1272 search results - page 203 / 255 » Approximate Parameterized Matching |
108
click to vote
ECCV
2002
Springer
16 years 29 days ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
183
click to vote
VLDB
2003
ACM
15 years 11 months ago
2003
ACM
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
WABI
2007
Springer
15 years 5 months ago
2007
Springer
The comprehensive annotation of non-coding RNAs in newly sequenced genomes is still a largely unsolved problem because many functional RNAs exhibit not only poorly conserved sequen...
101
click to vote
BIBE
2005
IEEE
15 years 4 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
104
click to vote
ICN
2005
Springer
15 years 4 months ago
2005
Springer
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...