4110 search results - page 281 / 822 » Efficient algorithms for the 2-gathering problem |
170
click to vote
CAD
2005
Springer
15 years 6 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...
179
click to vote
SIAMCOMP
2000
15 years 6 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...
138
click to vote
TMI
2002
15 years 6 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...
156
click to vote
STOC
2010
ACM
16 years 4 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
146
click to vote
CSR
2006
Springer
15 years 10 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...