9849 search results - page 106 / 1970 » Algorithms and Experiments for the Webgraph |
113
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
This paper presents two methods for improving the performance of the Distributed Breakout Algorithm using the notion of interchangeability. In particular, we use neighborhood part...
128
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix bandwidth minimization problem, which is to reduce bandwidth by permuting rows and ...
163
click to vote
DIS
2000
Springer
15 years 8 months ago
2000
Springer
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
153
click to vote
NLP
2000
15 years 8 months ago
2000
Abstract. The paper argues that a promising way to improve the success rate of preference-based anaphora resolution algorithms is the use of machine learning. The paper outlines MA...
108
click to vote
FLAIRS
2008
15 years 6 months ago
2008
This paper presents a syntactic path-based learning algorithm (CANDEL from CANDIDATE-ELIMINATION) for the coreference resolution of pronouns that have their antecedents in the sam...