5105 search results - page 60 / 1021 » An algorithm to determine peer-reviewers |
84
Voted
COLING
2002
15 years 8 days ago
2002
We consider here the problem of Base Noun Phrase translation. We propose a new method to perform the task. For a given Base NP, we first search its translation candidates from the...
115
Voted
INFOCOM
1997
IEEE
15 years 4 months ago
1997
IEEE
We investigate the problem of routing connections with QoS requirements across one or more networks, when the information available for making routing decisions is inaccurate and ...
112
click to vote
ESANN
2000
15 years 1 months ago
2000
: Support Vector Machines (SVMs) have become an increasingly popular tool for machine learning tasks involving classi cation, regression or novelty detection. They exhibit good gen...
EOR
2006
15 years 14 days ago
2006
We are concerned with a variation of the knapsack problem as well as of the knapsack sharing problem, where we are given a set of n items and a knapsack of a fixed capacity. As us...
94
Voted
NETWORKS
2008
15 years 12 days ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...