882 search results - page 129 / 177 » On the Hardness of Graph Isomorphism |
SIGSOFT
2003
ACM
14 years 1 months ago
2003
ACM
Most applications developed today rely on a given middleware platform which governs the interaction between components, the access to resources, etc. To decide, which platform is ...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
ESWS
2008
Springer
13 years 10 months ago
2008
Springer
Integrated access to multiple distributed and autonomous RDF data sources is a key challenge for many semantic web applications. As a reaction to this challenge, SPARQL, the W3C Re...
NIPS
2007
13 years 10 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...