1402 search results - page 182 / 281 » Sparse-Memory Graph Search |
146
click to vote
WWW
2006
ACM
16 years 5 months ago
2006
ACM
Ontologies are at the heart of the semantic web. They define the concepts and relationships that make global interoperability possible. However, as these ontologies grow in size t...
134
click to vote
WWW
2004
ACM
16 years 5 months ago
2004
ACM
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
132
click to vote
RECOMB
2007
Springer
16 years 4 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
234
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
142
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...