909 search results - page 86 / 182 » Performance Evaluation of the VF Graph Matching Algorithm |
CATS
2008
15 years 2 months ago
2008
Pollard's rho method is a randomized algorithm for computing discrete logarithms. It works by defining a pseudo-random sequence and then detecting a match in the sequence. Ma...
115
click to vote
SEMWEB
2010
Springer
14 years 11 months ago
2010
Springer
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
WWW
2008
ACM
16 years 2 months ago
2008
ACM
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
123
click to vote
ICDM
2006
IEEE
15 years 7 months ago
2006
IEEE
Mining graph data is an increasingly popular challenge, which has practical applications in many areas, including molecular substructure discovery, web link analysis, fraud detect...
149
click to vote
SPIRE
2005
Springer
15 years 6 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...