290 search results - page 12 / 58 » Local Partitioning for Directed Graphs Using PageRank |
CPAIOR
2007
Springer
15 years 5 months ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
110
click to vote
ICB
2007
Springer
15 years 5 months ago
2007
Springer
Palmprint recognition, as a reliable personal identity check method, has been receiving increasing attention during recent years. According to previous work, local texture analysis...
ICRA
2006
IEEE
15 years 5 months ago
2006
IEEE
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
DAGM
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. We present a hierarchical partitioning of images using a pairwise similarity function on a graph-based representation of an image. This function measures the difference ...
224
click to vote
GIS
2006
ACM
16 years 19 days ago
2006
ACM
If you were told that some object A was perfectly (or somewhat, or not at all) in some direction (e.g., west, above-right) of some reference object B, where in space would you loo...