290 search results - page 25 / 58 » Local Partitioning for Directed Graphs Using PageRank |
116
click to vote
ICRA
2005
IEEE
15 years 8 months ago
2005
IEEE
— We present a semi-parametric control policy representation and use it to solve a series of nonholonomic control problems with input state spaces of up to 7 dimensions. A neares...
134
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
7 Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are used within the segmentation framework to encode a hierarchy of pa...
176
click to vote
ECCV
2008
Springer
16 years 22 days 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 ...
152
click to vote
PAMI
2007
15 years 1 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
129
click to vote
IROS
2007
IEEE
15 years 8 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 ...