3206 search results - page 96 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
147
Voted
SIGMOD
2010
ACM
15 years 1 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
119
Voted
IEEEPACT
2006
IEEE
15 years 8 months ago
2006
IEEE
On machines with high-performance processors, the memory system continues to be a performance bottleneck. Compilers insert prefetch operations and reorder data accesses to improve...
108
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...
168
Voted
SI3D
2012
ACM
13 years 10 months ago
2012
ACM
In Virtual Environments (VE), users are often facing tasks that involve direct manipulation of virtual objects at close distances, such as touching, grabbing, placement. In immers...
139
click to vote
ESA
2009
Springer
15 years 9 months ago
2009
Springer
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...