711 search results - page 80 / 143 » Matching Hierarchical Structures Using Association Graphs |
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
EUROPAR
2005
Springer
14 years 1 months ago
2005
Springer
Nested-parallelism programming models, where the task graph associated to a computation is series-parallel, present good analysis properties that can be exploited for scheduling, c...
STACS
1992
Springer
13 years 11 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
IJRR
2008
13 years 7 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...
IGIS
1994
13 years 11 months ago
1994
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...