4469 search results - page 772 / 894 » Dynamic Program Slicing |
101
Voted
CCCG
1994
15 years 2 months ago
1994
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...
109
Voted
COLING
1996
15 years 2 months ago
1996
This paper snggests a method to align Korean-English parallel corpus. '1?he structural dissimilarity between Korean and Indo-European languages requires more flexible measure...
120
click to vote
ISMB
1996
15 years 2 months ago
1996
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
112
Voted
IJCAI
1993
15 years 2 months ago
1993
Whilst much emphasis in AI has been placed on the use of goals in problem solving, less emphasis has been placed on the role of perception and experience. In this paper we show th...
106
click to vote
ACL
1989
15 years 1 months ago
1989
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...