248 search results - page 27 / 50 » Parameterized Algorithms for Directed Maximum Leaf Problems |
ESA
2008
Springer
15 years 1 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
AAAI
2010
15 years 1 months ago
2010
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
AAAI
1996
15 years 1 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
KDD
2006
ACM
16 years 5 days ago
2006
ACM
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
COLING
1992
15 years 28 days ago
1992
In this paper, a discrimination and robusmess oriented adaptive learning procedure is proposed to deal with the task of syntactic ambiguity resolution. Owing to the problem of ins...