3206 search results - page 60 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
141
Voted
ICPP
1998
IEEE
15 years 6 months ago
1998
IEEE
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
107
Voted
WWW
2007
ACM
16 years 3 months ago
2007
ACM
In XML databases, materializing queries and their results into views in a semantic cache can improve the performance of query evaluation by reducing computational complexity and I...
134
Voted
SEMWEB
2010
Springer
15 years 9 days ago
2010
Springer
We study the problem of SPARQL query optimization on top of distributed hash tables. Existing works on SPARQL query processing in such environments have never been implemented in a...
113
Voted
WICON
2010
15 years 8 days ago
2010
In order to meet the overwhelming demands of content retrieval for mobile end users, a novel architecture for the next-generation Internet called Cache-and-Forward (CNF) has been p...
129
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...