Sciweavers

1132 search results - page 30 / 227
» Similarity Graphs
Sort
View
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
15 years 9 days ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
WG
2010
Springer
13 years 9 months ago
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlo...
JASIS
2007
125views more  JASIS 2007»
13 years 10 months ago
Approximate personal name-matching through finite-state graphs
cience Abstracts and Science Citation Index Expanded databases. The evaluation involved calculating the measures of precision and recall, based on completeness and accuracy. The re...
Carmen Galvez, Félix de Moya Anegón
CEC
2005
IEEE
14 years 27 days ago
Graph composition in a graph grammar-based method for automata network evolution
The dynamics of neural and other automata networks are defined to a large extent by their topologies. Artificial evolution constitutes a practical means by which an optimal topolog...
Martin H. Luerssen, David M. W. Powers
INFOCOM
2012
IEEE
12 years 1 months ago
Impact of power-law topology on IP-level routing dynamics: Simulation results
—This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random...
Amelie Medem Kuatse, Clémence Magnien, Fabi...