68 search results - page 1 / 14 » TALE: A Tool for Approximate Large Graph Matching |
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
ICPR
2010
IEEE
13 years 3 months ago
2010
IEEE
In this paper we propose a conductance electrical model to represent weighted undirected graphs that allows us to efficiently compute approximate graph isomorphism in large graph...
AAAI
2006
13 years 6 months ago
2006
People frequently use the world-wide web to find their most preferred item among a large range of options. We call this task preference-based search. The most common tool for pref...
PVLDB
2010
13 years 3 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
ACSC
2005
IEEE
13 years 10 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...