821 search results - page 74 / 165 » Addressing the Petersen graph |
158
Voted
FLAIRS
2008
15 years 6 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...
137
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
154
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
134
click to vote
CONCURRENCY
2006
15 years 4 months ago
2006
e a set of very distinctive abstractions that result in significant modifications of the basic workflow model as outlined in pre-existing workflow model, see [2] for example. In pa...
111
click to vote
IJRR
2008
15 years 4 months ago
2008
Recognizing useful modular robot configurations composed of hundreds of modules is a significant challenge. Matching a new modular robot configuration to a library of known configu...