1327 search results - page 170 / 266 » Path following algorithm for the graph matching problem |
126
click to vote
CIKM
2011
Springer
14 years 1 months ago
2011
Springer
This paper addresses the problem of mining named entity translations from comparable corpora, specifically, mining English and Chinese named entity translation. We first observe...
125
click to vote
ADHOC
2005
15 years 1 months ago
2005
Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy rou...
96
Voted
IPPS
1994
IEEE
15 years 6 months ago
1994
IEEE
Many algorithms to schedule DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is a...
130
click to vote
PR
2007
15 years 1 months ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
152
Voted
AI
2011
Springer
14 years 9 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...