1402 search results - page 8 / 281 » Sparse-Memory Graph Search |
109
click to vote
ISSAC
2007
Springer
15 years 7 months ago
2007
Springer
It is only in the last five years that researchers have begun to use disk-based search techniques on a large scale. The primary examples of its use come from symbolic algebra and...
ICCS
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, we aim at showing the advantages of Conceptual Graph formalism for the Semantic Web through several real-world applications in the framework of Corporate Semantic We...
LCN
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
112
click to vote
SIAMDM
2010
14 years 8 months ago
2010
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...