1402 search results - page 71 / 281 » Sparse-Memory Graph Search |
COMAD
2009
14 years 11 months ago
2009
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
SIGMETRICS
2002
ACM
14 years 9 months ago
2002
ACM
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...
COMMA
2008
14 years 11 months ago
2008
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Previous efforts on event detection from the web have focused primarily on web content and structure data ignoring the rich collection of web log data. In this paper, we propose t...
122
click to vote
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...