356 search results - page 37 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
97
Voted
IWPEC
2004
Springer
15 years 5 months ago
2004
Springer
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
113
click to vote
STAIRS
2008
15 years 1 months ago
2008
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...
150
Voted
ICCV
2005
IEEE
15 years 6 months ago
2005
IEEE
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...
122
Voted
IM
2008
15 years 12 days ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
121
click to vote
PAMI
2006
15 years 10 days ago
2006
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...