74 search results - page 4 / 15 » Fast incremental proximity search in large graphs |
ICDM
2008
IEEE
14 years 1 months ago
2008
IEEE
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
TEC
2008
13 years 6 months ago
2008
When hypervolume is used as part of the selection or archiving process in a multiobjective evolutionary algorithm, it is necessary to determine which solutions contribute the least...
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
－ It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
BIBM
2009
IEEE
14 years 1 months ago
2009
IEEE
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
WWW
2007
ACM
14 years 7 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...