5473 search results - page 104 / 1095 » On the graph isomorphism problem |
154
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
178
click to vote
LION
2009
Springer
16 years 27 days 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...
182
click to vote
EOR
2002
15 years 6 months ago
2002
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
153
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...
139
click to vote
PERCOM
2006
ACM
16 years 6 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...