1421 search results - page 33 / 285 » Algorithms for subsequence combinatorics |
PPSC
1997
14 years 11 months ago
1997
By taking data measurement errors into considerations, numerical results obtained by interval polynomial interpolation [5] are highly reliable. To reduce overestimation, combinati...
ACL
1990
14 years 10 months ago
1990
The principle known as 'free indexation' plays an important role in the determination of the referential properties of noun phrases in the principleand-parameters langua...
COCOON
2001
Springer
15 years 2 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....
CPM
2006
Springer
15 years 1 months ago
2006
Springer
A single logical entity can be referred to by several different names over a large text corpus. We present our algorithm for finding all suchco-reference sets in a large corpus. Ou...