3206 search results - page 234 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
175
click to vote
SLS
2009
Springer
15 years 10 months ago
2009
Springer
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
146
Voted
CIVR
2008
Springer
15 years 5 months ago
2008
Springer
Image clustering is useful in many retrieval and classification applications. The main goal of image clustering is to partition a given dataset into salient clusters such that the...
111
Voted
SWAT
2004
Springer
15 years 9 months 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...
158
click to vote
AI
1998
Springer
15 years 3 months ago
1998
Springer
In this paper, we address the tradeo between exploration and exploitation for agents which need to learn more about the structure of their environment in order to perform more e e...
175
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...