3206 search results - page 38 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
141
click to vote
GLOBECOM
2008
IEEE
15 years 2 months ago
2008
IEEE
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...
124
click to vote
ADBIS
2007
Springer
15 years 8 months ago
2007
Springer
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
99
Voted
INFOCOM
1999
IEEE
15 years 6 months ago
1999
IEEE
We describe the design, implementation and performance of a Web server accelerator which runs on an embedded operating system and improves Web server performance by caching data. ...
106
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
We present a universal algorithm for the classical online problem of caching or demand paging. We consider the caching problem when the page request sequence is drawn from an unkn...
124
Voted
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...