10608 search results - page 648 / 2122 » Complexity of O'Hara's Algorithm |
190
click to vote
SPIRE
2005
Springer
16 years 22 days ago
2005
Springer
We introduce a normalized version of the LCS metric as a new local similarity measure for comparing two RNAs. An O(n2 m lg m) time algorithm is presented for computing the maximum ...
185
click to vote
ICIP
2003
IEEE
16 years 16 days ago
2003
IEEE
Existing algorithms for exact helical cone beam (HCB) tomographic reconstruction are computationally infeasible for clinical applications. Their computational cost is dominated by...
206
Voted
COMPGEOM
2003
ACM
16 years 15 days ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
174
click to vote
INDOCRYPT
2001
Springer
15 years 11 months ago
2001
Springer
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Comple...
221
click to vote
ICMCS
2000
IEEE
15 years 11 months ago
2000
IEEE
The goal of QoS routing is to find a loopless path through a network that can satisfy a given set of constraints on parameters such as bandwidth, delay and cost. QoS routing algo...