9849 search results - page 274 / 1970 » Algorithms and Experiments for the Webgraph |
220
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Visitors enter a website through a variety of means, including web searches, links from other sites, and personal bookmarks. In some cases the first page loaded satisfies the visi...
242
click to vote
SIGMOD
1993
ACM
15 years 11 months ago
1993
ACM
This paper introduces a new approach to database disk buffering, called the LRU–K method. The basic idea of LRU–K is to keep track of the times of the last K references to pop...
242
click to vote
ANTSW
2004
Springer
15 years 11 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
220
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
179
click to vote
SWAT
2004
Springer
16 years 17 days ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...