1983 search results - page 161 / 397 » Competitive graph searches |
FLAIRS
2008
13 years 10 months ago
2008
The problem of recognizing textual entailment (RTE) has been recently addressed using syntactic and lexical models with some success. Here, we further explore this problem, this t...
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
OOPSLA
2005
Springer
14 years 1 months ago
2005
Springer
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...
ICPR
2000
IEEE
14 years 13 days ago
2000
IEEE
We describe a graph-based global registration method for creating 2D mosaic images. When multi-frames overlap in space, global registration is necessary to minimize the accumulate...
BMVC
2001
13 years 10 months ago
2001
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...