5962 search results - page 1002 / 1193 » Efficient Clustering for Orders |
192
click to vote
COLING
1996
15 years 8 months ago
1996
We address the problem of automatically acquiring case frame patterns (selectional patterns) from large corpus data. In particular, we l)ropose a method of learning dependencies b...
178
click to vote
IJCAI
1993
15 years 8 months ago
1993
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
180
click to vote
ISMB
1996
15 years 8 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...
181
click to vote
ISMB
1994
15 years 8 months ago
1994
Wepresent algorithms for kinematic manipulation of molecular chains subject to fixed bond lengths and bond angles. They are useful for calculating conformations of a molecule subj...
166
click to vote
ISMB
1993
15 years 8 months ago
1993
Experiment design and execution is a central activity in the natural sciences. The SeqERsystem provides a general architecture for the integration of automated planning techniques...