1951 search results - page 124 / 391 » An algorithm for improving graph partitions |
145
click to vote
LION
2009
Springer
15 years 11 months ago
2009
Springer
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
135
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We propose a method to improve the results of image search engines on the Internet to satisfy users who desire to see relevant images in the first few pages. The method re-ranks ...
162
click to vote
EUROSYS
2007
ACM
16 years 1 months ago
2007
ACM
Two oft-cited file systems, the Fast File System (FFS) and the Log-Structured File System (LFS), adopt two sharply different update strategies—update-in-place and update-out-of-...
138
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
158
click to vote
HPCC
2005
Springer
15 years 10 months ago
2005
Springer
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...