4112 search results - page 367 / 823 » Efficient Algorithms for the Spoonerism Problem |
200
click to vote
ENTCS
2008
15 years 7 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
202
click to vote
CAD
2005
Springer
15 years 7 months ago
2005
Springer
We introduce a new approach to the problem of collision detection in multi-axis NC-machining. Due to the directional nature (tool axis) of multi-axis NCmachining, space subdivisio...
211
click to vote
SIAMCOMP
2000
15 years 7 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
157
click to vote
TMI
2002
15 years 7 months ago
2002
Abstract--We present an explicit formula for B-spline convolution kernels; these are defined as the convolution of several B-splines of variable widths and degrees . We apply our r...
170
click to vote
CSR
2006
Springer
15 years 11 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...