144227 search results - page 28545 / 28846 » Using the |
127
click to vote
CORR
1999
Springer
15 years 4 months ago
1999
Springer
In recent work we have presented a formal framework for linguistic annotation based on labeled acyclic digraphs. These `annotation graphs' oer a simple yet powerful method fo...
149
Voted
CPC
1999
15 years 4 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
128
Voted
JASIS
1998
15 years 4 months ago
1998
This article develops a theoretical framework of distributed representations to explore the representational properties in group problem solving. The basic principle of distribute...
121
Voted
JCB
1998
15 years 4 months ago
1998
The function of an unknown biological sequence can often be accurately inferred by identifying sequences homologous to the original sequence. Given a query set of known homologs, ...
135
click to vote
JCC
1998
15 years 4 months ago
1998
: A novel procedure for docking ligands in a flexible binding site is presented. It relies on conjugate gradient minimization, during which nonbonded interactions are gradually swi...