1809 search results - page 77 / 362 » On Score Distributions and Relevance |
146
click to vote
GCB
1997
Springer
15 years 10 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
145
click to vote
EMNLP
2008
15 years 7 months ago
2008
We show that jointly parsing a bitext can substantially improve parse quality on both sides. In a maximum entropy bitext parsing model, we define a distribution over source trees,...
140
click to vote
NIPS
2004
15 years 7 months ago
2004
In this paper we propose a novel method for learning a Mahalanobis distance measure to be used in the KNN classification algorithm. The algorithm directly maximizes a stochastic v...
175
click to vote
EMNLP
2010
15 years 4 months ago
2010
Existing graph-based ranking methods for keyphrase extraction compute a single importance score for each word via a single random walk. Motivated by the fact that both documents a...
182
click to vote
CSMR
2004
IEEE
15 years 10 months ago
2004
IEEE
Combining static and dynamic information is highly relevant in many reverse engineering, program comprehension and maintenance task. Dynamic analysis is particularly effective whe...