160 search results - page 21 / 32 » A New Algorithm for Inexact Graph Matching |
PPOPP
2012
ACM
13 years 5 months ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
AAAI
2012
13 years 1 days ago
2012
Widespread accounts of the harmful effects of invasive species have stimulated both practical and theoretical studies on how the spread of these destructive agents can be containe...
54
Voted
DATE
1997
IEEE
15 years 1 months ago
1997
IEEE
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
FLAIRS
2010
15 years 3 hour ago
2010
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...
ACSC
2001
IEEE
15 years 1 months ago
2001
IEEE
This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space req...