156 search results - page 19 / 32 » Local Graph Partitioning using PageRank Vectors |
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
IROS
2007
IEEE
14 years 2 months ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
GECCO
2006
Springer
14 years 7 days ago
2006
Springer
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection a...
NIPS
2001
13 years 10 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
ACPC
1999
Springer
14 years 27 days ago
1999
Springer
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...